Translatability of Schemas over Restricted Interpretations. - A. J. Kfoury (J. Comput. Syst. Sci., 1974)

On the Termination of Program Schemas - A. J. Kfoury; David Michael Ritchie Park (Inf. Control., 1975)

Loop Elimination and Loop Reduction-A Model-Theoretic Analysis of Programs (Partial Report) - A. J. Kfoury (FOCS, 1980)

Analysis of Simple Programs Over Different Sets of Primitives. - A. J. Kfoury (POPL, 1980)

A Basis for Theoretical Computer Science. - Michael A. Arbib; Assaf J. Kfoury; Robert N. Moll (Springer, 1981)

Some Connections Between iterative Programs, Recursive Programs, and First-Order Logic. - A. J. Kfoury (Logic of Programs, 1981)

A Programming Approach to Computability - Assaf J. Kfoury; Robert N. Moll; Michael A. Arbib (Springer, 1982)

Necessary and Sufficient Conditions for University of Programming Formalisms (Partial Report). - A. J. Kfoury; Pawel Urzyczyn (Logic of Programs, 1983)

Definability by Programs in First-Order Structures. - A. J. Kfoury (Theor. Comput. Sci., 1983)

Necessary and Sufficient Conditions for the Universality of Programming Formalisms. - A. J. Kfoury; Pawel Urzyczyn (Acta Informatica, 1985)

Definability by Deterministic and Non-deterministic Programs (with Applications to First-Order Dynamic Logic) - A. J. Kfoury (Inf. Control., 1985)

The Unwind Property for Programs with Bounded Memory. - A. J. Kfoury (Inf. Process. Lett., 1985)

The Hierarchy of Finitely Typed Functional Programs (Short Version) - A. J. Kfoury; Jerzy Tiuryn; Pawel Urzyczyn (LICS, 1987)

An Introduction to Formal Language Theory - Robert N. Moll; Michael A. Arbib; A. J. Kfoury (Springer, 1988)

On the Computational Power of Universally Polymorphic Recursion - A. J. Kfoury; Jerzy Tiuryn; Pawel Urzyczyn (LICS, 1988)

A Proper Extension of ML with an Effective Type-Assignment. - A. J. Kfoury; Jerzy Tiuryn; Pawel Urzyczyn (POPL, 1988)

A Linear-Time Algorithm to Decide Whether A Binary Word Contains An Overlap. - A. J. Kfoury (RAIRO Theor. Informatics Appl., 1988)

Algo-Like Languages with Higher-Order Procedures and Their Expressive Power. - A. J. Kfoury; Pawel Urzyczyn (Logic at Botik, 1989)

Computational Consequences and Partial Solutions of a Generalized Unification Problem (Partial Report) - A. J. Kfoury; Jerzy Tiuryn; Pawel Urzyczyn (LICS, 1989)

Minutes of the 4th annual LICS business meeting. - William M. Farmer; A. J. Kfoury (SIGACT News, 1989)

ML Typability is DEXTIME-Complete. - A. J. Kfoury; Jerzy Tiuryn; Pawel Urzyczyn (CAAP, 1990)

Type Reconstruction in Finite-Rank Fragments of the Polymorphic lambda-Calculus (Extended Summary) - A. J. Kfoury; Jerzy Tiuryn (LICS, 1990)

The Undecidability of the Semi-Unification Problem (Preliminary Report) - A. J. Kfoury; Jerzy Tiuryn; Pawel Urzyczyn (STOC, 1990)

On the Expressive Power of Finitely and Universally Polymorphic Recursive Procedures. - A. J. Kfoury; Jerzy Tiuryn; Pawel Urzyczyn (Theor. Comput. Sci., 1992)

Type Reconstruction in Finite Rank Fragments of the Second-Order lambda-Calculus - A. J. Kfoury; Jerzy Tiuryn (Inf. Comput., 1992)

Type Reconstruction in the Presence of Polymorphic Recursion. - A. J. Kfoury; Jerzy Tiuryn; Pawel Urzyczyn (ACM Trans. Program. Lang. Syst., 1993)

The Undecidability of the Semi-unification Problem - A. J. Kfoury; Jerzy Tiuryn; Pawel Urzyczyn (Inf. Comput., 1993)

A Direct Algorithm for Type Inference in the Rank-2 Fragment of the Second-Order lambda-Calculus. - A. J. Kfoury; J. B. Wells (LISP and Functional Programming, 1994)

An Analysis of ML Typability. - A. J. Kfoury; Jerzy Tiuryn; Pawel Urzyczyn (J. ACM, 1994)

New Notions of Reduction and Non-Semantic Proofs of beta-Strong Normalization in Typed lambda-Calculi - A. J. Kfoury; J. B. Wells (LICS, 1995)

Recursion Versus Iteration at Higher-Orders. - A. J. Kfoury (FSTTCS, 1997)

An Infinite Pebble Game and Applications. - A. J. Kfoury; Alexei P. Stolboushkin (Inf. Comput., 1997)

Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems (Extended Abstract). - Assaf J. Kfoury; Harry G. Mairson; Franklyn A. Turbak; J. B. Wells (ICFP, 1999)

Type Inference for Recursive Definitions. - A. J. Kfoury; Santiago M. Pericás-Geertsen (LICS, 1999)

Principality and Decidable Type Inference for Finite-Rank Intersection Types. - A. J. Kfoury; J. B. Wells (POPL, 1999)

Alpha-Conversion and Typability. - A. J. Kfoury; Simona Ronchi Della Rocca; Jerzy Tiuryn; Pawel Urzyczyn (Inf. Comput., 1999)

A linearization of the Lambda-calculus and consequences. - A. J. Kfoury (J. Log. Comput., 2000)

Type theory and rewriting theory for expressive, efficient and reliable programming languages. - A. J. Kfoury (ACM SIGSOFT Softw. Eng. Notes, 2000)

What Are Polymorphically-Typed Ambients? - Torben Amtoft; A. J. Kfoury; Santiago M. Pericás-Geertsen (ESOP, 2001)

Orderly communication in the Ambient Calculus. - Torben Amtoft; A. J. Kfoury; Santiago M. Pericás-Geertsen (Comput. Lang. Syst. Struct., 2002)

Implementing Compositional Analysis Using Intersection Types With Expansion Variables. - Assaf J. Kfoury; Geoffrey Washburn; Joe B. Wells (ITRS, 2002)

Systematic Verification of Safety Properties of Arbitrary Network Protocol Compositions Using CHAIN. - Adam D. Bradley; Azer Bestavros; Assaf J. Kfoury (ICNP, 2003)

System E: Expansion Variables for Flexible Typing with Linear and Non-linear Types and Intersection Types. - Sébastien Carlier; Jeff Polakow; J. B. Wells; A. J. Kfoury (ESOP, 2004)

A Typed Model for Encoding-Based Protocol Interoperability. - Adam D. Bradley; Azer Bestavros; Assaf J. Kfoury (ICNP, 2004)

Safe compositional specification of networking systems. - Azer Bestavros; Adam D. Bradley; Assaf J. Kfoury; Ibrahim Matta (Comput. Commun. Rev., 2004)

Programming Examples Needing Polymorphic Recursion. - J. J. Hallett; Assaf J. Kfoury (ITRS, 2004)

Principality and type inference for intersection types using expansion variables. - A. J. Kfoury; J. B. Wells (Theor. Comput. Sci., 2004)

Typed Abstraction of Complex Network Compositions. - Azer Bestavros; Adam D. Bradley; Assaf J. Kfoury; Ibrahim Matta (ICNP, 2005)

Formal semantics of weak references. - Kevin Donnelly; J. J. Hallett; Assaf J. Kfoury (ISMM, 2006)

snBench: programming and virtualization framework for distributed multitasking sensor networks. - Michael J. Ocean; Azer Bestavros; Assaf J. Kfoury (VEE, 2006)

A calculus for java's reference objects. - Yarom Gabay; Assaf J. Kfoury (ACM SIGPLAN Notices, 2007)

A formal type-centric framework for verification and resource allocation in pervasive Sense-and-Respond systems. - Michael J. Ocean; Assaf J. Kfoury; Azer Bestavros (MOMPES, 2009)

Safe compositional network sketches: formal framework. - Azer Bestavros; Assaf J. Kfoury; Andrei Lapets; Michael J. Ocean (HSCC, 2010)

A Type-Theoretic Framework for Efficient and Safe Colocation of Periodic Real-Time Systems. - Vatche Ishakian; Azer Bestavros; Assaf J. Kfoury (RTCSA, 2010)

A User-friendly Interface for a Lightweight Verification System. - Andrei Lapets; Assaf J. Kfoury (UITP, 2010)

The Complexity of Restricted Variants of the Stable Paths Problem. - Kevin Donnelly; Assaf J. Kfoury; Andrei Lapets (Fundam. Informaticae, 2010)

Safe Compositional Equation-based Modeling of Constrained Flow Networks. - Nate Soule; Azer Bestavros; Assaf J. Kfoury; Andrei Lapets (EOOLT, 2011)

Formal Verification of SLA Transformations. - Vatche Ishakian; Andrei Lapets; Azer Bestavros; Assaf J. Kfoury (SERVICES, 2011)

A Domain-Specific Language for Incremental and Modular Design of Large-Scale Verifiably-Safe Flow Networks (Preliminary Report). - Azer Bestavros; Assaf J. Kfoury (DSL, 2011)

Verifiably-safe software-defined networks for CPS. - Richard William Skowyra; Andrei Lapets; Azer Bestavros; Assaf J. Kfoury (HiCoNS, 2013)

Towards accessible integration and deployment of formal tools and techniques. - Andrei Lapets; Richard Skowyra; Azer Bestavros; Assaf J. Kfoury (TOPI@ICSE, 2013)

Preface to special issue: lightweight and practical formal methods in the design and analysis of safety-critical systems. - Azer Bestavros; Assaf J. Kfoury (Math. Struct. Comput. Sci., 2013)

Postlude: seamless composition and integration - a perspective on formal methods research. - Azer Bestavros; Assaf J. Kfoury; Andrei Lapets (Math. Struct. Comput. Sci., 2013)

A Verification Platform for SDN-Enabled Applications. - Richard Skowyra; Andrei Lapets; Azer Bestavros; Assaf J. Kfoury (IC2E, 2014)

The syntax and semantics of a domain-specific language for flow-network design. - Assaf J. Kfoury (Sci. Comput. Program., 2014)

Linear Arrangement of Halin Graphs. - Saber Mirzaei; Assaf J. Kfoury (CoRR, 2015)

Using Alloy to Formally Model and Reason About an OpenFlow Network Switch. - Saber Mirzaei; Sanaz Bahargam; Richard Skowyra; Assaf J. Kfoury; Azer Bestavros (CoRR, 2016)

Efficient Reassembling of Graphs, Part 2: The Balanced Case. - Saber Mirzaei; Assaf J. Kfoury (CoRR, 2016)

Shortest path and maximum flow problems in planar flow networks with additive gains and losses. - Saber Mirzaei; Assaf J. Kfoury (CoRR, 2016)

Efficient reassembling of graphs, part 1: the linear case. - Assaf J. Kfoury; Saber Mirzaei (J. Comb. Optim., 2017)

Mathematical Logic in Computer Science. - Assaf J. Kfoury (CoRR, 2018)

A Compositional Approach to Network Algorithms. - Assaf J. Kfoury (CoRR, 2018)

A Fixed-Parameter Linear-Time Algorithm for Maximum Flow in Planar Flow Networks. - Assaf J. Kfoury (CoRR, 2018)

A Fixed-Parameter Linear-Time Algorithm to Compute Principal Typings of Planar Flow Networks. - Assaf J. Kfoury (CoRR, 2018)

MORPHOSYS: Efficient Colocation of QoS-Constrained Workloads in the Cloud. - Vatche Ishakian; Azer Bestavros; Assaf J. Kfoury (CoRR, 2019)

Personal Reflections on the Role of Mathematical Logic in Computer Science. - Assaf J. Kfoury (Fundam. Informaticae, 2019)

Efficient reassembling of three-regular planar graphs. - Assaf J. Kfoury; Benjamin Sisson (J. Comb. Optim., 2020)