 | 2009 |
| 12 |  | Karthikeyan Bhargavan,
Ricardo Corin,
Pierre-Malo Deniélou,
Cédric Fournet,
James J. Leifer:
Cryptographic Protocol Synthesis and Verification for Multiparty Sessions.
CSF 2009: 124-140 |
| 2008 |
| 11 |  | Ricardo Corin,
Pierre-Malo Deniélou,
Cédric Fournet,
Karthikeyan Bhargavan,
James J. Leifer:
A secure compiler for session abstractions.
Journal of Computer Security 16(5): 573-636 (2008) |
| 2007 |
| 10 |  | Ricardo Corin,
Pierre-Malo Deniélou,
Cédric Fournet,
Karthikeyan Bhargavan,
James J. Leifer:
Secure Implementations for Typed Session Abstractions.
CSF 2007: 170-186 |
| 9 |  | Peter Sewell,
James J. Leifer,
Keith Wansbrough,
Francesco Zappa Nardelli,
Mair Allen-Williams,
Pierre Habouzit,
Viktor Vafeiadis:
Acute: High-level programming language design for distributed computation.
J. Funct. Program. 17(4-5): 547-612 (2007) |
| 2006 |
| 8 |  | Pierre-Malo Deniélou,
James J. Leifer:
Abstraction preservation and subtyping in distributed languages.
ICFP 2006: 286-297 |
| 7 |  | James J. Leifer,
Robin Milner:
Transition systems, link graphs and Petri nets.
Mathematical Structures in Computer Science 16(6): 989-1047 (2006) |
| 2005 |
| 6 |  | Peter Sewell,
James J. Leifer,
Keith Wansbrough,
Francesco Zappa Nardelli,
Mair Allen-Williams,
Pierre Habouzit,
Viktor Vafeiadis:
Acute: high-level programming language design for distributed computation.
ICFP 2005: 15-26 |
| 2003 |
| 5 |  | James J. Leifer,
Gilles Peskine,
Peter Sewell,
Keith Wansbrough:
Global abstraction-safe marshalling with hash types.
ICFP 2003: 87-98 |
| 4 |  | James J. Leifer,
Gilles Peskine,
Peter Sewell,
Keith Wansbrough:
Global abstraction-safe marshalling with hash types.
SIGPLAN Notices 38(9): 87-98 (2003) |
| 2002 |
| 3 |  | James J. Leifer,
Robin Milner:
Shallow Linear Action Graphs and their Embeddings.
Formal Asp. Comput. 13(3-5): 327-340 (2002) |
| 2000 |
| 2 |  | James J. Leifer,
Robin Milner:
Deriving Bisimulation Congruences for Reactive Systems.
CONCUR 2000: 243-258 |
| 1996 |
| 1 |  | James J. Leifer,
Bernard Sufrin:
Deduction for Functional Programmers.
J. Funct. Program. 6(2): 365-373 (1996) |