Assaf J. Kfoury

According to our database, Assaf J. Kfoury authored at least 77 papers between 1974 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2020

Efficient reassembling of three-regular planar graphs.

Assaf J. Kfoury, Benjamin Sisson

J. Comb. Optim., 2020

2019

Personal Reflections on the Role of Mathematical Logic in Computer Science.

Assaf J. Kfoury

Fundam. Informaticae, 2019

MORPHOSYS: Efficient Colocation of QoS-Constrained Workloads in the Cloud.

Vatche Ishakian, Azer Bestavros, Assaf J. Kfoury

CoRR, 2019

2018

A Fixed-Parameter Linear-Time Algorithm to Compute Principal Typings of Planar Flow Networks.

Assaf J. Kfoury

CoRR, 2018

A Fixed-Parameter Linear-Time Algorithm for Maximum Flow in Planar Flow Networks.

Assaf J. Kfoury

CoRR, 2018

A Compositional Approach to Network Algorithms.

Assaf J. Kfoury

CoRR, 2018

Mathematical Logic in Computer Science.

Assaf J. Kfoury

CoRR, 2018

2017

Efficient reassembling of graphs, part 1: the linear case.

Assaf J. Kfoury, Saber Mirzaei

J. Comb. Optim., 2017

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 2: The Balanced Case.

Saber Mirzaei, Assaf J. Kfoury

CoRR, 2016

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

2015

Linear Arrangement of Halin Graphs.

Saber Mirzaei, Assaf J. Kfoury

CoRR, 2015

2014

The syntax and semantics of a domain-specific language for flow-network design.

Assaf J. Kfoury

Sci. Comput. Program., 2014

A Verification Platform for SDN-Enabled Applications.

Richard Skowyra, Andrei Lapets, Azer Bestavros, Assaf J. Kfoury

Proceedings of the 2014 IEEE International Conference on Cloud Engineering, 2014

2013

Postlude: seamless composition and integration - a perspective on formal methods research.

Azer Bestavros, Assaf J. Kfoury, Andrei Lapets

Math. Struct. Comput. Sci., 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

Towards accessible integration and deployment of formal tools and techniques.

Andrei Lapets, Richard Skowyra, Azer Bestavros, Assaf J. Kfoury

Proceedings of the 3rd International Workshop on Developing Tools as Plug-ins, 2013

Verifiably-safe software-defined networks for CPS.

Richard William Skowyra, Andrei Lapets, Azer Bestavros, Assaf J. Kfoury

Proceedings of the 2nd ACM International Conference on High Confidence Networked Systems (part of CPS Week), 2013

2011

A Domain-Specific Language for Incremental and Modular Design of Large-Scale Verifiably-Safe Flow Networks (Preliminary Report).

Azer Bestavros, Assaf J. Kfoury

Proceedings of the Proceedings IFIP Working Conference on Domain-Specific Languages, 2011

Formal Verification of SLA Transformations.

Vatche Ishakian, Andrei Lapets, Azer Bestavros, Assaf J. Kfoury

Proceedings of the World Congress on Services, 2011

Safe Compositional Equation-based Modeling of Constrained Flow Networks.

Nate Soule, Azer Bestavros, Assaf J. Kfoury, Andrei Lapets

Proceedings of the 4th International Workshop on Equation-Based Object-Oriented Modeling Languages and Tools, 2011

2010

The Complexity of Restricted Variants of the Stable Paths Problem.

Kevin Donnelly, Assaf J. Kfoury, Andrei Lapets

Fundam. Informaticae, 2010

A User-friendly Interface for a Lightweight Verification System.

Andrei Lapets, Assaf J. Kfoury

Proceedings of the 9th International Workshop On User Interfaces for Theorem Provers, 2010

A Type-Theoretic Framework for Efficient and Safe Colocation of Periodic Real-Time Systems.

Vatche Ishakian, Azer Bestavros, Assaf J. Kfoury

Proceedings of the 16th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, 2010

Safe compositional network sketches: formal framework.

Azer Bestavros, Assaf J. Kfoury, Andrei Lapets, Michael J. Ocean

Proceedings of the 13th ACM International Conference on Hybrid Systems: Computation and Control, 2010

2009

A formal type-centric framework for verification and resource allocation in pervasive Sense-and-Respond systems.

Michael J. Ocean, Assaf J. Kfoury, Azer Bestavros

Proceedings of the ICSE 2009 Workshop on Model-Based Methodologies for Pervasive and Embedded Software, 2009

2007

A calculus for java's reference objects.

Yarom Gabay, Assaf J. Kfoury

ACM SIGPLAN Notices, 2007

2006

snBench: programming and virtualization framework for distributed multitasking sensor networks.

Michael J. Ocean, Azer Bestavros, Assaf J. Kfoury

Proceedings of the 2nd International Conference on Virtual Execution Environments, 2006

Formal semantics of weak references.

Kevin Donnelly, J. J. Hallett, Assaf J. Kfoury

Proceedings of the 5th International Symposium on Memory Management, 2006

2005

Typed Abstraction of Complex Network Compositions.

Azer Bestavros, Adam D. Bradley, Assaf J. Kfoury, Ibrahim Matta

Proceedings of the 13th IEEE International Conference on Network Protocols (ICNP 2005), 2005

2004

Principality and type inference for intersection types using expansion variables.

A. J. Kfoury, J. B. Wells

Theor. Comput. Sci., 2004

Programming Examples Needing Polymorphic Recursion.

J. J. Hallett, Assaf J. Kfoury

Proceedings of the Third International Workshop on Intersection Types and Related Systems, 2004

Safe compositional specification of networking systems.

Azer Bestavros, Adam D. Bradley, Assaf J. Kfoury, Ibrahim Matta

Comput. Commun. Rev., 2004

A Typed Model for Encoding-Based Protocol Interoperability.

Adam D. Bradley, Azer Bestavros, Assaf J. Kfoury

Proceedings of the 12th IEEE International Conference on Network Protocols (ICNP 2004), 2004

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

Proceedings of the Programming Languages and Systems, 2004

2003

Systematic Verification of Safety Properties of Arbitrary Network Protocol Compositions Using CHAIN.

Adam D. Bradley, Azer Bestavros, Assaf J. Kfoury

Proceedings of the 11th IEEE International Conference on Network Protocols (ICNP 2003), 2003

2002

Implementing Compositional Analysis Using Intersection Types With Expansion Variables.

Assaf J. Kfoury, Geoffrey Washburn, Joe B. Wells

Proceedings of the Intersection Types and Related Systems, 2002

Orderly communication in the Ambient Calculus.

Torben Amtoft, A. J. Kfoury, Santiago M. Pericás-Geertsen

Comput. Lang. Syst. Struct., 2002

2001

What Are Polymorphically-Typed Ambients?

Torben Amtoft, A. J. Kfoury, Santiago M. Pericás-Geertsen

Proceedings of the Programming Languages and Systems, 2001

2000

Type theory and rewriting theory for expressive, efficient and reliable programming languages.

A. J. Kfoury

ACM SIGSOFT Softw. Eng. Notes, 2000

A linearization of the Lambda-calculus and consequences.

A. J. Kfoury

J. Log. Comput., 2000

1999

Alpha-Conversion and Typability.

A. J. Kfoury, Simona Ronchi Della Rocca, Jerzy Tiuryn, Pawel Urzyczyn

Inf. Comput., 1999

Principality and Decidable Type Inference for Finite-Rank Intersection Types.

A. J. Kfoury, J. B. Wells

Proceedings of the POPL '99, 1999

Type Inference for Recursive Definitions.

A. J. Kfoury, Santiago M. Pericás-Geertsen

Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

Relating Typability and Expressiveness in Finite-Rank Intersection Type Systems (Extended Abstract).

Assaf J. Kfoury, Harry G. Mairson, Franklyn A. Turbak, J. B. Wells

Proceedings of the fourth ACM SIGPLAN International Conference on Functional Programming (ICFP '99), 1999

1997

An Infinite Pebble Game and Applications.

A. J. Kfoury, Alexei P. Stolboushkin

Inf. Comput., 1997

Recursion Versus Iteration at Higher-Orders.

A. J. Kfoury

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1997

1995

New Notions of Reduction and Non-Semantic Proofs of beta-Strong Normalization in Typed lambda-Calculi

A. J. Kfoury, J. B. Wells

Proceedings of the Proceedings, 1995

1994

An Analysis of ML Typability.

A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn

J. ACM, 1994

A Direct Algorithm for Type Inference in the Rank-2 Fragment of the Second-Order lambda-Calculus.

A. J. Kfoury, J. B. Wells

Proceedings of the 1994 ACM Conference on LISP and Functional Programming, 1994

1993

The Undecidability of the Semi-unification Problem

A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn

Inf. Comput., January, 1993

Type Reconstruction in the Presence of Polymorphic Recursion.

A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn

ACM Trans. Program. Lang. Syst., 1993

1992

Type Reconstruction in Finite Rank Fragments of the Second-Order lambda-Calculus

A. J. Kfoury, Jerzy Tiuryn

Inf. Comput., June, 1992

On the Expressive Power of Finitely and Universally Polymorphic Recursive Procedures.

A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn

Theor. Comput. Sci., 1992

1990

The Undecidability of the Semi-Unification Problem (Preliminary Report)

A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

Type Reconstruction in Finite-Rank Fragments of the Polymorphic lambda-Calculus (Extended Summary)

A. J. Kfoury, Jerzy Tiuryn

Proceedings of the Fifth Annual Symposium on Logic in Computer Science (LICS '90), 1990

ML Typability is DEXTIME-Complete.

A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn

Proceedings of the CAAP '90, 1990

1989

Minutes of the 4th annual LICS business meeting.

William M. Farmer, A. J. Kfoury

SIGACT News, 1989

Computational Consequences and Partial Solutions of a Generalized Unification Problem (Partial Report)

A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn

Proceedings of the Fourth Annual Symposium on Logic in Computer Science (LICS '89), 1989

Algo-Like Languages with Higher-Order Procedures and Their Expressive Power.

A. J. Kfoury, Pawel Urzyczyn

Proceedings of the Logic at Botik '89, 1989

1988

A Proper Extension of ML with an Effective Type-Assignment.

A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn

Proceedings of the Conference Record of the Fifteenth Annual ACM Symposium on Principles of Programming Languages, 1988

On the Computational Power of Universally Polymorphic Recursion

A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn

Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

An Introduction to Formal Language Theory

Robert N. Moll, Michael A. Arbib, A. J. Kfoury

Texts and Monographs in Computer Science, Springer, ISBN: 978-1-4613-9595-9, 1988

1987

The Hierarchy of Finitely Typed Functional Programs (Short Version)

A. J. Kfoury, Jerzy Tiuryn, Pawel Urzyczyn

Proceedings of the Symposium on Logic in Computer Science (LICS '87), 1987

1986

A linear-time algorithm to decide whether a binary word contains an overlap.

A. J. Kfoury

Bull. EATCS, 1986

1985

The Unwind Property for Programs with Bounded Memory.

A. J. Kfoury

Inf. Process. Lett., 1985

Definability by Deterministic and Non-deterministic Programs (with Applications to First-Order Dynamic Logic)

A. J. Kfoury

Inf. Control., 1985

Necessary and Sufficient Conditions for the Universality of Programming Formalisms.

A. J. Kfoury, Pawel Urzyczyn

Acta Informatica, 1985

1983

Definability by Programs in First-Order Structures.

A. J. Kfoury

Theor. Comput. Sci., 1983

Necessary and Sufficient Conditions for University of Programming Formalisms (Partial Report).

A. J. Kfoury, Pawel Urzyczyn

Proceedings of the Logics of Programs, 1983

1982

A Programming Approach to Computability

Assaf J. Kfoury, Robert N. Moll, Michael A. Arbib

Texts and Monographs in Computer Science, Springer, ISBN: 978-1-4612-5749-3, 1982

1981

Some Connections Between iterative Programs, Recursive Programs, and First-Order Logic.

A. J. Kfoury

Proceedings of the Logics of Programs, Workshop, Yorktown Heights, New York, USA, May 1981, 1981

A Basis for Theoretical Computer Science.

Michael A. Arbib, Assaf J. Kfoury, Robert N. Moll

Texts and Monographs in Computer Science, Springer, ISBN: 3540905731, 1981

1980

Analysis of Simple Programs Over Different Sets of Primitives.

A. J. Kfoury

Proceedings of the Conference Record of the Seventh Annual ACM Symposium on Principles of Programming Languages, 1980

Loop Elimination and Loop Reduction-A Model-Theoretic Analysis of Programs (Partial Report)

A. J. Kfoury

Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

1975

On the Termination of Program Schemas

A. J. Kfoury, David Michael Ritchie Park

Inf. Control., November, 1975

1974

Translatability of Schemas over Restricted Interpretations.

A. J. Kfoury

J. Comput. Syst. Sci., 1974