A. J. Kfoury
List of publications from the
| 2007 |
|---|
| 48 | EE | Yarom Gabay,
Assaf J. Kfoury:
A calculus for java's reference objects.
SIGPLAN Notices 42(8): 9-17 (2007) |
| 2006 |
|---|
| 47 | EE | Kevin Donnelly,
J. J. Hallett,
Assaf J. Kfoury:
Formal semantics of weak references.
ISMM 2006: 126-137 |
| 46 | EE | Michael J. Ocean,
Azer Bestavros,
Assaf J. Kfoury:
snBench: programming and virtualization framework for distributed multitasking sensor networks.
VEE 2006: 89-99 |
| 2005 |
|---|
| 45 | EE | Azer Bestavros,
Adam Bradley,
Assaf J. Kfoury,
Ibrahim Matta:
Typed Abstraction of Complex Network Compositions.
ICNP 2005: 289-300 |
| 44 | EE | J. J. Hallett,
Assaf J. Kfoury:
Programming Examples Needing Polymorphic Recursion.
Electr. Notes Theor. Comput. Sci. 136: 57-102 (2005) |
| 2004 |
|---|
| 43 | EE | 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 |
| 42 | EE | Adam Bradley,
Azer Bestavros,
Assaf J. Kfoury:
A Typed Model for Encoding-Based Protocol Interoperability.
ICNP 2004: 72-83 |
| 41 | EE | Azer Bestavros,
Adam Bradley,
Assaf J. Kfoury,
Ibrahim Matta:
Safe compositional specification of networking systems.
Computer Communication Review 34(3): 21-34 (2004) |
| 40 | EE | 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) |
| 2003 |
|---|
| 39 | EE | Adam Bradley,
Azer Bestavros,
Assaf J. Kfoury:
Systematic Verification of Safety Properties of Arbitrary Network Protocol Compositions Using CHAIN.
ICNP 2003: 234- |
| 2002 |
|---|
| 38 | | Torben Amtoft,
A. J. Kfoury,
Santiago M. Pericás-Geertsen:
Orderly communication in the Ambient Calculus.
Comput. Lang. 28(1): 29-60 (2002) |
| 37 | EE | Assaf J. Kfoury,
Geoffrey Washburn,
Joe Wells:
Implementing Compositional Analysis Using Intersection Types With Expansion Variables.
Electr. Notes Theor. Comput. Sci. 70(1): (2002) |
| 2001 |
|---|
| 36 | EE | Torben Amtoft,
A. J. Kfoury,
Santiago M. Pericás-Geertsen:
What Are Polymorphically-Typed Ambients?
ESOP 2001: 206-220 |
| 2000 |
|---|
| 35 | | A. J. Kfoury:
A linearization of the Lambda-calculus and consequences.
J. Log. Comput. 10(3): 411-436 (2000) |
| 1999 |
|---|
| 34 | EE | A. 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 |
| 33 | EE | A. J. Kfoury,
Santiago M. Pericás-Geertsen:
Type Inference for Recursive Definitions.
LICS 1999: 119-129 |
| 32 | EE | A. J. Kfoury,
J. B. Wells:
Principality and Decidable Type Inference for Finite-Rank Intersection Types.
POPL 1999: 161-174 |
| 31 | | A. J. Kfoury,
Simona Ronchi Della Rocca,
Jerzy Tiuryn,
Pawel Urzyczyn:
Alpha-Conversion and Typability.
Inf. Comput. 150(1): 1-21 (1999) |
| 1997 |
|---|
| 30 | EE | A. J. Kfoury:
Recursion Versus Iteration at Higher-Orders.
FSTTCS 1997: 57-73 |
| 29 | | A. J. Kfoury,
Alexei P. Stolboushkin:
An Infinite Pebble Game and Applications.
Inf. Comput. 136(1): 53-66 (1997) |
| 1995 |
|---|
| 28 | | 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 |
|---|
| 27 | EE | 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 |
| 26 | EE | A. J. Kfoury,
Jerzy Tiuryn,
Pawel Urzyczyn:
An Analysis of ML Typability.
J. ACM 41(2): 368-398 (1994) |
| 1993 |
|---|
| 25 | EE | 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) |
| 24 | | A. J. Kfoury,
Jerzy Tiuryn,
Pawel Urzyczyn:
The Undecidability of the Semi-unification Problem
Inf. Comput. 102(1): 83-101 (1993) |
| 1992 |
|---|
| 23 | | A. J. Kfoury,
Jerzy Tiuryn:
Type Reconstruction in Finite Rank Fragments of the Second-Order lambda-Calculus
Inf. Comput. 98(2): 228-257 (1992) |
| 22 | | 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 |
|---|
| 21 | | A. J. Kfoury,
Jerzy Tiuryn,
Pawel Urzyczyn:
ML Typability is DEXTIME-Complete.
CAAP 1990: 206-220 |
| 20 | | A. J. Kfoury,
Jerzy Tiuryn:
Type Reconstruction in Finite-Rank Fragments of the Polymorphic lambda-Calculus (Extended Summary)
LICS 1990: 2-11 |
| 19 | | A. J. Kfoury,
Jerzy Tiuryn,
Pawel Urzyczyn:
The Undecidability of the Semi-Unification Problem (Preliminary Report)
STOC 1990: 468-476 |
| 1989 |
|---|
| 18 | | A. J. Kfoury,
Jerzy Tiuryn,
Pawel Urzyczyn:
Computational Consequences and Partial Solutions of a Generalized Unification Problem (Partial Report)
LICS 1989: 98-105 |
| 17 | | A. J. Kfoury,
Pawel Urzyczyn:
Algo-Like Languages with Higher-Order Procedures and Their Expressive Power.
Logic at Botik 1989: 186-199 |
| 1988 |
|---|
| 16 | | Robert N. Moll,
Michael A. Arbib,
A. J. Kfoury:
An Introduction to Formal Language Theory
Springer 1988 |
| 15 | | A. J. Kfoury,
Jerzy Tiuryn,
Pawel Urzyczyn:
On the Computational Power of Universally Polymorphic Recursion
LICS 1988: 72-81 |
| 14 | | A. J. Kfoury,
Jerzy Tiuryn,
Pawel Urzyczyn:
A Proper Extension of ML with an Effective Type-Assignment.
POPL 1988: 58-69 |
| 13 | | A. J. Kfoury:
A Linear-Time Algorithm to Decide Whether A Binary Word Contains An Overlap.
ITA 22(2): 135-145 (1988) |
| 1987 |
|---|
| 12 | | A. J. Kfoury,
Jerzy Tiuryn,
Pawel Urzyczyn:
The Hierarchy of Finitely Typed Functional Programs (Short Version)
LICS 1987: 225-235 |
| 1986 |
|---|
| 11 | | A. J. Kfoury:
A linear-time algorithm to decide whether a binary word contains an overlap.
Bulletin of the EATCS 30: 74-79 (1986) |
| 1985 |
|---|
| 10 | | A. J. Kfoury,
Pawel Urzyczyn:
Necessary and Sufficient Conditions for the Universality of Programming Formalisms.
Acta Inf. 22(4): 347-377 (1985) |
| 9 | | A. J. Kfoury:
The Unwind Property for Programs with Bounded Memory.
Inf. Process. Lett. 21(5): 233-238 (1985) |
| 8 | | A. J. Kfoury:
Definability by Deterministic and Non-deterministic Programs (with Applications to First-Order Dynamic Logic)
Information and Control 65(2/3): 98-121 (1985) |
| 1983 |
|---|
| 7 | | A. J. Kfoury,
Pawel Urzyczyn:
Necessary and Sufficient Conditions for University of Programming Formalisms (Partial Report).
Logic of Programs 1983: 279-289 |
| 6 | | A. J. Kfoury:
Definability by Programs in First-Order Structures.
Theor. Comput. Sci. 25: 1-66 (1983) |
| 1981 |
|---|
| 5 | | A. J. Kfoury:
Some Connections Between iterative Programs, Recursive Programs, and First-Order Logic.
Logic of Programs 1981: 150-166 |
| 1980 |
|---|
| 4 | | A. J. Kfoury:
Loop Elimination and Loop Reduction-A Model-Theoretic Analysis of Programs (Partial Report)
FOCS 1980: 173-184 |
| 3 | | A. J. Kfoury:
Analysis of Simple Programs Over Different Sets of Primitives.
POPL 1980: 56-61 |
| 1975 |
|---|
| 2 | | A. J. Kfoury,
David Michael Ritchie Park:
On the Termination of Program Schemas
Information and Control 29(3): 243-251 (1975) |
| 1974 |
|---|
| 1 | | A. J. Kfoury:
Translatability of Schemas over Restricted Interpretations.
J. Comput. Syst. Sci. 8(3): 387-408 (1974) |
