default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAssaf J. Kfoury
Person information
- affiliation: Boston University, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j29]Assaf J. Kfoury, Benjamin Sisson:
Efficient reassembling of three-regular planar graphs. J. Comb. Optim. 39(4): 1153-1207 (2020)
2010 – 2019
- 2019
- [j28]Assaf J. Kfoury:
Personal Reflections on the Role of Mathematical Logic in Computer Science. Fundam. Informaticae 170(1-3): 207-221 (2019) - [i11]Vatche Ishakian, Azer Bestavros, Assaf J. Kfoury:
MORPHOSYS: Efficient Colocation of QoS-Constrained Workloads in the Cloud. CoRR abs/1912.00549 (2019) - 2018
- [i10]Assaf J. Kfoury:
Mathematical Logic in Computer Science. CoRR abs/1802.03292 (2018) - [i9]Assaf J. Kfoury:
A Compositional Approach to Network Algorithms. CoRR abs/1805.07491 (2018) - [i8]Assaf J. Kfoury, Benjamin Sisson:
Efficient Reassembling of Three-Regular Planar Graphs. CoRR abs/1807.03479 (2018) - [i7]Assaf J. Kfoury:
A Fixed-Parameter Linear-Time Algorithm for Maximum Flow in Planar Flow Networks. CoRR abs/1807.04186 (2018) - [i6]Assaf J. Kfoury:
A Fixed-Parameter Linear-Time Algorithm to Compute Principal Typings of Planar Flow Networks. CoRR abs/1807.07067 (2018) - 2017
- [j27]Assaf J. Kfoury, Saber Mirzaei:
Efficient reassembling of graphs, part 1: the linear case. J. Comb. Optim. 33(3): 1057-1089 (2017) - 2016
- [i5]Saber Mirzaei, Assaf J. Kfoury:
Efficient Reassembling of Graphs, Part 2: The Balanced Case. CoRR abs/1602.02863 (2016) - [i4]Saber Mirzaei, Assaf J. Kfoury:
Shortest path and maximum flow problems in planar flow networks with additive gains and losses. CoRR abs/1603.08997 (2016) - [i3]Saber Mirzaei, Sanaz Bahargam, Richard Skowyra, Assaf J. Kfoury, Azer Bestavros:
Using Alloy to Formally Model and Reason About an OpenFlow Network Switch. CoRR abs/1604.00060 (2016) - 2015
- [i2]Assaf J. Kfoury, Saber Mirzaei:
Efficient Reassembling of Graphs, Part 1: The Linear Case. CoRR abs/1509.06434 (2015) - [i1]Saber Mirzaei, Assaf J. Kfoury:
Linear Arrangement of Halin Graphs. CoRR abs/1509.08145 (2015) - 2014
- [j26]Assaf J. Kfoury:
The syntax and semantics of a domain-specific language for flow-network design. Sci. Comput. Program. 93: 19-38 (2014) - [c37]Richard Skowyra, Andrei Lapets
, Azer Bestavros, Assaf J. Kfoury:
A Verification Platform for SDN-Enabled Applications. IC2E 2014: 337-342 - 2013
- [j25]Azer Bestavros, Assaf J. Kfoury:
Preface to special issue: lightweight and practical formal methods in the design and analysis of safety-critical systems. Math. Struct. Comput. Sci. 23(4): 675 (2013) - [j24]Azer Bestavros, Assaf J. Kfoury, Andrei Lapets:
Postlude: seamless composition and integration - a perspective on formal methods research. Math. Struct. Comput. Sci. 23(4): 934-943 (2013) - [c36]Richard William Skowyra, Andrei Lapets, Azer Bestavros, Assaf J. Kfoury:
Verifiably-safe software-defined networks for CPS. HiCoNS 2013: 101-110 - [c35]Andrei Lapets, Richard Skowyra, Azer Bestavros, Assaf J. Kfoury:
Towards accessible integration and deployment of formal tools and techniques. TOPI@ICSE 2013: 19-24 - [e1]Richard Lazarus, Assaf J. Kfoury, Jacob Beal:
Proceedings of the 1st annual workshop on Functional programming concepts in domain-specific languages, FPCDSL@ICFP 2013, Boston, Massachusetts, USA, September 22, 2013. ACM 2013, ISBN 978-1-4503-2380-2 [contents] - 2011
- [c34]Nate Soule, Azer Bestavros, Assaf J. Kfoury, Andrei Lapets:
Safe Compositional Equation-based Modeling of Constrained Flow Networks. EOOLT 2011: 35-44 - [c33]Vatche Ishakian, Andrei Lapets, Azer Bestavros, Assaf J. Kfoury:
Formal Verification of SLA Transformations. SERVICES 2011: 540-547 - [c32]Azer Bestavros, Assaf J. Kfoury:
A Domain-Specific Language for Incremental and Modular Design of Large-Scale Verifiably-Safe Flow Networks (Preliminary Report). DSL 2011: 24-47 - 2010
- [j23]Kevin Donnelly, Assaf J. Kfoury, Andrei Lapets:
The Complexity of Restricted Variants of the Stable Paths Problem. Fundam. Informaticae 103(1-4): 69-87 (2010) - [c31]Azer Bestavros, Assaf J. Kfoury, Andrei Lapets, Michael J. Ocean:
Safe compositional network sketches: formal framework. HSCC 2010: 231-241 - [c30]Vatche Ishakian, Azer Bestavros, Assaf J. Kfoury:
A Type-Theoretic Framework for Efficient and Safe Colocation of Periodic Real-Time Systems. RTCSA 2010: 143-152 - [c29]Andrei Lapets, Assaf J. Kfoury:
A User-friendly Interface for a Lightweight Verification System. UITP 2010: 29-41
2000 – 2009
- 2009
- [c28]Michael J. Ocean, Assaf J. Kfoury, Azer Bestavros:
A formal type-centric framework for verification and resource allocation in pervasive Sense-and-Respond systems. MOMPES 2009: 31-41 - 2007
- [j22]Yarom Gabay, Assaf J. Kfoury:
A calculus for java's reference objects. ACM SIGPLAN Notices 42(8): 9-17 (2007) - 2006
- [c27]Kevin Donnelly, J. J. Hallett, Assaf J. Kfoury:
Formal semantics of weak references. ISMM 2006: 126-137 - [c26]Michael J. Ocean, Azer Bestavros, Assaf J. Kfoury:
snBench: programming and virtualization framework for distributed multitasking sensor networks. VEE 2006: 89-99 - 2005
- [c25]Azer Bestavros, Adam D. Bradley, Assaf J. Kfoury, Ibrahim Matta:
Typed Abstraction of Complex Network Compositions. ICNP 2005: 289-300 - 2004
- [j21]Azer Bestavros, Adam D. Bradley, Assaf J. Kfoury, Ibrahim Matta:
Safe compositional specification of networking systems. Comput. Commun. Rev. 34(3): 21-34 (2004) - [j20]A. J. Kfoury, J. B. Wells:
Principality and type inference for intersection types using expansion variables. Theor. Comput. Sci. 311(1-3): 1-70 (2004) - [c24]Sébastien Carlier, Jeff Polakow, J. B. Wells, A. J. Kfoury:
System E: Expansion Variables for Flexible Typing with Linear and Non-linear Types and Intersection Types. ESOP 2004: 294-309 - [c23]Adam D. Bradley, Azer Bestavros, Assaf J. Kfoury:
A Typed Model for Encoding-Based Protocol Interoperability. ICNP 2004: 72-83 - [c22]J. J. Hallett, Assaf J. Kfoury:
Programming Examples Needing Polymorphic Recursion. ITRS 2004: 57-102 - 2003
- [c21]Adam D. Bradley, Azer Bestavros, Assaf J. Kfoury:
Systematic Verification of Safety Properties of Arbitrary Network Protocol Compositions Using CHAIN. ICNP 2003: 234- - 2002
- [j19]Torben Amtoft, A. J. Kfoury, Santiago M. Pericás-Geertsen:
Orderly communication in the Ambient Calculus. Comput. Lang. Syst. Struct. 28(1): 29-60 (2002) - [c20]Assaf J. Kfoury, Geoffrey Washburn, Joe B. Wells:
Implementing Compositional Analysis Using Intersection Types With Expansion Variables. ITRS 2002: 124-148 - 2001
- [c19]Torben Amtoft, A. J. Kfoury, Santiago M. Pericás-Geertsen:
What Are Polymorphically-Typed Ambients? ESOP 2001: 206-220 - 2000
- [j18]A. J. Kfoury:
A linearization of the Lambda-calculus and consequences. J. Log. Comput. 10(3): 411-436 (2000) - [j17]A. J. Kfoury:
Type theory and rewriting theory for expressive, efficient and reliable programming languages. ACM SIGSOFT Softw. Eng. Notes 25(1): 61-62 (2000)
1990 – 1999
- 1999
- [j16]A. J. Kfoury, Simona Ronchi Della Rocca, Jerzy Tiuryn, Pawel Urzyczyn:
Alpha-Conversion and Typability. Inf. Comput. 150(1): 1-21 (1999) - [c18]Assaf J. Kfoury, Harry G. Mairson, Franklyn A. Turbak, J. B. Wells:
Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems (Extended Abstract). ICFP 1999: 90-101 - [c17]A. J. Kfoury, Santiago M. Pericás-Geertsen:
Type Inference for Recursive Definitions. LICS 1999: 119-128 - [c16]A. J. Kfoury, J. B. Wells:
Principality and Decidable Type Inference for Finite-Rank Intersection Types. POPL 1999: 161-174 - 1997
- [j15]A. J. Kfoury, Alexei P. Stolboushkin:
An Infinite Pebble Game and Applications. Inf. Comput. 136(1): 53-66 (1997) - [c15]A. J. Kfoury:
Recursion Versus Iteration at Higher-Orders. FSTTCS 1997: 57-73 - 1995
- [c14]A. J. Kfoury, J. B. Wells:
New Notions of Reduction and Non-Semantic Proofs of beta-Strong Normalization in Typed lambda-Calculi. LICS 1995: 311-321 - 1994
- [j14]A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn:
An Analysis of ML Typability. J. ACM 41(2): 368-398 (1994) - [c13]A. J. Kfoury, J. B. Wells:
A Direct Algorithm for Type Inference in the Rank-2 Fragment of the Second-Order lambda-Calculus. LISP and Functional Programming 1994: 196-207 - 1993
- [j13]A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn:
The Undecidability of the Semi-unification Problem. Inf. Comput. 102(1): 83-101 (1993) - [j12]A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn:
Type Reconstruction in the Presence of Polymorphic Recursion. ACM Trans. Program. Lang. Syst. 15(2): 290-311 (1993) - 1992
- [j11]A. J. Kfoury, Jerzy Tiuryn:
Type Reconstruction in Finite Rank Fragments of the Second-Order lambda-Calculus. Inf. Comput. 98(2): 228-257 (1992) - [j10]A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn:
On the Expressive Power of Finitely and Universally Polymorphic Recursive Procedures. Theor. Comput. Sci. 93(1): 1-41 (1992) - 1990
- [c12]A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn:
ML Typability is DEXTIME-Complete. CAAP 1990: 206-220 - [c11]A. J. Kfoury, Jerzy Tiuryn:
Type Reconstruction in Finite-Rank Fragments of the Polymorphic lambda-Calculus (Extended Summary). LICS 1990: 2-11 - [c10]A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn:
The Undecidability of the Semi-Unification Problem (Preliminary Report). STOC 1990: 468-476
1980 – 1989
- 1989
- [j9]William M. Farmer, A. J. Kfoury:
Minutes of the 4th annual LICS business meeting. SIGACT News 20(4): 43-47 (1989) - [c9]A. J. Kfoury, Pawel Urzyczyn:
Algo-Like Languages with Higher-Order Procedures and Their Expressive Power. Logic at Botik 1989: 186-199 - [c8]A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn:
Computational Consequences and Partial Solutions of a Generalized Unification Problem (Partial Report). LICS 1989: 98-105 - 1988
- [b3]Robert N. Moll, Michael A. Arbib, A. J. Kfoury:
An Introduction to Formal Language Theory. Texts and Monographs in Computer Science, Springer 1988, ISBN 0-387-96698-6, pp. i-x, 1-205 - [j8]A. J. Kfoury:
A Linear-Time Algorithm to Decide Whether A Binary Word Contains An Overlap. RAIRO Theor. Informatics Appl. 22(2): 135-145 (1988) - [c7]A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn:
On the Computational Power of Universally Polymorphic Recursion. LICS 1988: 72-81 - [c6]A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn:
A Proper Extension of ML with an Effective Type-Assignment. POPL 1988: 58-69 - 1987
- [c5]A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn:
The Hierarchy of Finitely Typed Functional Programs (Short Version). LICS 1987: 225-235 - 1986
- [j7]A. J. Kfoury:
A linear-time algorithm to decide whether a binary word contains an overlap. Bull. EATCS 30: 74-79 (1986) - 1985
- [j6]A. J. Kfoury, Pawel Urzyczyn:
Necessary and Sufficient Conditions for the Universality of Programming Formalisms. Acta Informatica 22(4): 347-377 (1985) - [j5]A. J. Kfoury:
Definability by Deterministic and Non-deterministic Programs (with Applications to First-Order Dynamic Logic). Inf. Control. 65(2/3): 98-121 (1985) - [j4]A. J. Kfoury:
The Unwind Property for Programs with Bounded Memory. Inf. Process. Lett. 21(5): 233-238 (1985) - 1983
- [j3]A. J. Kfoury:
Definability by Programs in First-Order Structures. Theor. Comput. Sci. 25: 1-66 (1983) - [c4]A. J. Kfoury, Pawel Urzyczyn:
Necessary and Sufficient Conditions for University of Programming Formalisms (Partial Report). Logic of Programs 1983: 279-289 - 1982
- [b2]Assaf J. Kfoury, Robert N. Moll, Michael A. Arbib:
A Programming Approach to Computability. Texts and Monographs in Computer Science, Springer 1982, ISBN 978-1-4612-5751-6, pp. i-viii, 1-253 - 1981
- [b1]Michael A. Arbib, Assaf J. Kfoury, Robert N. Moll:
A Basis for Theoretical Computer Science. Texts and Monographs in Computer Science, Springer 1981, ISBN 978-0-387-90573-0, pp. I-VIII, 1-220 - [c3]A. J. Kfoury:
Some Connections Between iterative Programs, Recursive Programs, and First-Order Logic. Logic of Programs 1981: 150-166 - 1980
- [c2]A. J. Kfoury:
Loop Elimination and Loop Reduction-A Model-Theoretic Analysis of Programs (Partial Report). FOCS 1980: 173-184 - [c1]A. J. Kfoury:
Analysis of Simple Programs Over Different Sets of Primitives. POPL 1980: 56-61
1970 – 1979
- 1975
- [j2]A. J. Kfoury, David Michael Ritchie Park:
On the Termination of Program Schemas. Inf. Control. 29(3): 243-251 (1975) - 1974
- [j1]A. J. Kfoury:
Translatability of Schemas over Restricted Interpretations. J. Comput. Syst. Sci. 8(3): 387-408 (1974)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
