Assaf J. Kfoury
According to our database1, Assaf J. Kfoury authored at least 77 papers between 1974 and 2018.
Collaborative distances :
Collaborative distances :
Legend:Book In proceedings Article PhD thesis Other
A Fixed-Parameter Linear-Time Algorithm to Compute Principal Typings of Planar Flow Networks.
A Fixed-Parameter Linear-Time Algorithm for Maximum Flow in Planar Flow Networks.
Efficient Reassembling of Three-Regular Planar Graphs.
A Compositional Approach to Network Algorithms.
Mathematical Logic in Computer Science.
Efficient reassembling of graphs, part 1: the linear case.
J. Comb. Optim., 2017
Shortest path and maximum flow problems in planar flow networks with additive gains and losses.
Efficient Reassembling of Graphs, Part 2: The Balanced Case.
Using Alloy to Formally Model and Reason About an OpenFlow Network Switch.
Linear Arrangement of Halin Graphs.
Efficient Reassembling of Graphs, Part 1: The Linear Case.
The syntax and semantics of a domain-specific language for flow-network design.
Sci. Comput. Program., 2014
A Verification Platform for SDN-Enabled Applications.
Proceedings of the 2014 IEEE International Conference on Cloud Engineering, 2014
Postlude: seamless composition and integration - a perspective on formal methods research.
Mathematical Structures in Computer Science, 2013
Preface to special issue: lightweight and practical formal methods in the design and analysis of safety-critical systems.
Mathematical Structures in Computer Science, 2013
Towards accessible integration and deployment of formal tools and techniques.
Proceedings of the 3rd International Workshop on Developing Tools as Plug-ins, 2013
Verifiably-safe software-defined networks for CPS.
Proceedings of the 2nd ACM International Conference on High Confidence Networked Systems (part of CPS Week), 2013
A User-friendly Interface for a Lightweight Verification System.
Electr. Notes Theor. Comput. Sci., 2012
A Domain-Specific Language for Incremental and Modular Design of Large-Scale Verifiably-Safe Flow Networks (Preliminary Report).
Proceedings of the Proceedings IFIP Working Conference on Domain-Specific Languages, 2011
Formal Verification of SLA Transformations.
Proceedings of the World Congress on Services, 2011
Safe Compositional Equation-based Modeling of Constrained Flow Networks.
Proceedings of the 4th International Workshop on Equation-Based Object-Oriented Modeling Languages and Tools, 2011
The Complexity of Restricted Variants of the Stable Paths Problem.
Fundam. Inform., 2010
A Type-Theoretic Framework for Efficient and Safe Colocation of Periodic Real-Time Systems.
Proceedings of the 16th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications, 2010
Safe compositional network sketches: formal framework.
Proceedings of the 13th ACM International Conference on Hybrid Systems: Computation and Control, 2010
A formal type-centric framework for verification and resource allocation in pervasive Sense-and-Respond systems.
Proceedings of the ICSE 2009 Workshop on Model-Based Methodologies for Pervasive and Embedded Software, 2009
A calculus for java's reference objects.
SIGPLAN Notices, 2007
snBench: programming and virtualization framework for distributed multitasking sensor networks.
Proceedings of the 2nd International Conference on Virtual Execution Environments, 2006
Formal semantics of weak references.
Proceedings of the 5th International Symposium on Memory Management, 2006
Programming Examples Needing Polymorphic Recursion.
Electr. Notes Theor. Comput. Sci., 2005
Typed Abstraction of Complex Network Compositions.
Proceedings of the 13th IEEE International Conference on Network Protocols (ICNP 2005), 2005
Principality and type inference for intersection types using expansion variables.
Theor. Comput. Sci., 2004
Safe compositional specification of networking systems.
Computer Communication Review, 2004
A Typed Model for Encoding-Based Protocol Interoperability.
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.
Proceedings of the Programming Languages and Systems, 2004
Systematic Verification of Safety Properties of Arbitrary Network Protocol Compositions Using CHAIN.
Proceedings of the 11th IEEE International Conference on Network Protocols (ICNP 2003), 2003
Implementing Compositional Analysis Using Intersection Types With Expansion Variables.
Electr. Notes Theor. Comput. Sci., 2002
Orderly communication in the Ambient Calculus.
Comput. Lang., 2002
What Are Polymorphically-Typed Ambients?
Proceedings of the Programming Languages and Systems, 2001
Type theory and rewriting theory for expressive, efficient and reliable programming languages.
ACM SIGSOFT Software Engineering Notes, 2000
A linearization of the Lambda-calculus and consequences.
J. Log. Comput., 2000
Alpha-Conversion and Typability.
Inf. Comput., 1999
Principality and Decidable Type Inference for Finite-Rank Intersection Types.
Proceedings of the POPL '99, 1999
Type Inference for Recursive Definitions.
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).
Proceedings of the fourth ACM SIGPLAN International Conference on Functional Programming (ICFP '99), 1999
An Infinite Pebble Game and Applications.
Inf. Comput., 1997
Recursion Versus Iteration at Higher-Orders.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1997
New Notions of Reduction and Non-Semantic Proofs of beta-Strong Normalization in Typed lambda-Calculi
Proceedings of the Proceedings, 1995
An Analysis of ML Typability.
J. ACM, 1994
A Direct Algorithm for Type Inference in the Rank-2 Fragment of the Second-Order lambda-Calculus.
LISP and Functional Programming, 1994
The Undecidability of the Semi-unification Problem
Inf. Comput., January, 1993
Type Reconstruction in the Presence of Polymorphic Recursion.
ACM Trans. Program. Lang. Syst., 1993
Type Reconstruction in Finite Rank Fragments of the Second-Order lambda-Calculus
Inf. Comput., June, 1992
On the Expressive Power of Finitely and Universally Polymorphic Recursive Procedures.
Theor. Comput. Sci., 1992
The Undecidability of the Semi-Unification Problem (Preliminary Report)
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)
Proceedings of the Fifth Annual Symposium on Logic in Computer Science (LICS '90), 1990
ML Typability is DEXTIME-Complete.
Proceedings of the CAAP '90, 1990
Minutes of the 4th annual LICS business meeting.
SIGACT News, 1989
Computational Consequences and Partial Solutions of a Generalized Unification Problem (Partial Report)
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.
Proceedings of the Logic at Botik '89, 1989
A Linear-Time Algorithm to Decide Whether A Binary Word Contains An Overlap.
A Proper Extension of ML with an Effective Type-Assignment.
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
Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988
An Introduction to Formal Language Theory
Texts and Monographs in Computer Science, Springer, ISBN: 978-1-4613-9595-9, 1988
The Hierarchy of Finitely Typed Functional Programs (Short Version)
Proceedings of the Symposium on Logic in Computer Science (LICS '87), 1987
A linear-time algorithm to decide whether a binary word contains an overlap.
Bulletin of the EATCS, 1986
The Unwind Property for Programs with Bounded Memory.
Inf. Process. Lett., 1985
Definability by Deterministic and Non-deterministic Programs (with Applications to First-Order Dynamic Logic)
Information and Control, 1985
Necessary and Sufficient Conditions for the Universality of Programming Formalisms.
Acta Inf., 1985
Definability by Programs in First-Order Structures.
Theor. Comput. Sci., 1983
Necessary and Sufficient Conditions for University of Programming Formalisms (Partial Report).
Proceedings of the Logics of Programs, 1983
A Programming Approach to Computability
Texts and Monographs in Computer Science, Springer, ISBN: 978-1-4612-5749-3, 1982
Some Connections Between iterative Programs, Recursive Programs, and First-Order Logic.
Proceedings of the Logics of Programs, Workshop, Yorktown Heights, New York, USA, May 1981, 1981
A Basis for Theoretical Computer Science.
Texts and Monographs in Computer Science, Springer, ISBN: 3540905731, 1981
Analysis of Simple Programs Over Different Sets of Primitives.
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)
Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980
On the Termination of Program Schemas
Information and Control, November, 1975
Translatability of Schemas over Restricted Interpretations.
J. Comput. Syst. Sci., 1974