 | 2009 |
|---|
| 50 |       | Radha Jagadeesan,
Alan Jeffrey,
Corin Pitcher,
James Riely:
Towards a Theory of Accountability and Audit.
ESORICS 2009: 152-167 |
| 49 | | Alan Jeffrey,
Taghrid Samak:
Model Checking Firewall Policy Configurations.
POLICY 2009: 60-67 |
| 2008 |
|---|
| 48 | | Michael Benedikt,
Alan Jeffrey,
Ruy Ley-Wild:
Stream firewalling of xml constraints.
SIGMOD Conference 2008: 487-498 |
| 47 | | Radha Jagadeesan,
Alan Jeffrey,
Corin Pitcher,
James Riely:
Lambda-RBAC: Programming with Role-Based Access Control.
Logical Methods in Computer Science 4(1): (2008) |
| 46 | | Alan Jeffrey,
Julian Rathke:
Full abstraction for polymorphic pi-calculus.
Theor. Comput. Sci. 390(2-3): 171-196 (2008) |
| 2007 |
|---|
| 45 | | Michael Benedikt,
Alan Jeffrey:
Efficient and Expressive Tree Filters.
FSTTCS 2007: 461-472 |
| 44 | | Radha Jagadeesan,
Alan Jeffrey,
Corin Pitcher,
James Riely:
Lambda-RBAC: Programming with Role-Based Access Control
CoRR abs/0712.1205: (2007) |
| 2006 |
|---|
| 43 | | Radha Jagadeesan,
Alan Jeffrey,
Corin Pitcher,
James Riely:
lambda-RBAC: Programming with Role-Based Access Control.
ICALP (2) 2006: 456-467 |
| 42 | | Christian Haack,
Alan Jeffrey:
Pattern-matching spi-calculus.
Inf. Comput. 204(8): 1195-1263 (2006) |
| 41 | | Radha Jagadeesan,
Alan Jeffrey,
James Riely:
Typed parametric polymorphism for aspects.
Sci. Comput. Program. 63(3): 267-296 (2006) |
| 2005 |
|---|
| 40 | | Andrew D. Gordon,
Alan Jeffrey:
Secrecy Despite Compromise: Types, Cryptography, and the Pi-Calculus.
CONCUR 2005: 186-201 |
| 39 | | Christian Haack,
Alan Jeffrey:
Timed Spi-Calculus with Types for Secrecy and Authenticity.
CONCUR 2005: 202-216 |
| 38 | | Alan Jeffrey,
Julian Rathke:
Java Jr: Fully Abstract Trace Semantics for a Core Java Language.
ESOP 2005: 423-438 |
| 37 | | Alan Jeffrey,
Julian Rathke:
Full Abstraction for Polymorphic Pi-Calculus.
FoSSaCS 2005: 266-281 |
| 36 | | Alan Jeffrey,
Julian Rathke:
Contextual equivalence for higher-order pi-calculus revisited
CoRR abs/cs/0503067: (2005) |
| 35 | | Alan Jeffrey,
Julian Rathke:
Contextual equivalence for higher-order pi-calculus revisited.
Logical Methods in Computer Science 1(1): (2005) |
| 34 | | Alan Jeffrey,
Julian Rathke:
A fully abstract may testing semantics for concurrent objects.
Theor. Comput. Sci. 338(1-3): 17-63 (2005) |
| 2004 |
|---|
| 33 | | Glenn Bruns,
Radha Jagadeesan,
Alan Jeffrey,
James Riely:
µABC: A Minimal Aspect Calculus.
CONCUR 2004: 209-224 |
| 32 | | Christian Haack,
Alan Jeffrey:
Pattern-Matching Spi-Calculus.
Formal Aspects in Security and Trust 2004: 55-70 |
| 31 |  | Andrew D. Gordon,
Alan Jeffrey:
Types and effects for asymmetric cryptographic protocols.
Journal of Computer Security 12(3-4): 435-483 (2004) |
| 30 | | Alan Jeffrey,
Julian Rathke:
A theory of bisimulation for a fragment of concurrent ML with local names.
Theor. Comput. Sci. 323(1-3): 1-48 (2004) |
| 2003 |
|---|
| 29 | | Radha Jagadeesan,
Alan Jeffrey,
James Riely:
A Calculus of Untyped Aspect-Oriented Programs.
ECOOP 2003: 54-73 |
| 28 | | Andrew D. Gordon,
Alan Jeffrey:
Authenticity by Typing for Security Protocols.
Journal of Computer Security 11(4): 451-520 (2003) |
| 27 | | Andrew D. Gordon,
Alan Jeffrey:
Typing correspondence assertions for communication protocols.
Theor. Comput. Sci. 300(1-3): 379-409 (2003) |
| 2002 |
|---|
| 26 | | Andrew D. Gordon,
Alan Jeffrey:
Types and Effects for Asymmetric Cryptographic Protocols.
CSFW 2002: 77-91 |
| 25 | | Andrew D. Gordon,
Alan Jeffrey:
Typing One-to-One and One-to-Many Correspondences in Security Protocols.
ISSS 2002: 263-282 |
| 24 | | Alan Jeffrey,
Julian Rathke:
A Fully Abstract May Testing Semantics for Concurrent Objects.
LICS 2002: 101-112 |
| 2001 |
|---|
| 23 | | Andrew D. Gordon,
Alan Jeffrey:
Authenticity by Typing for Security Protocols.
CSFW 2001: 145-159 |
| 22 | | Alan Jeffrey:
A Symbolic Labelled Transition System for Coinductive Subtyping of Fµ< Types.
LICS 2001: 323-333 |
| 21 | | Andrew D. Gordon,
Alan Jeffrey:
A Type and Effect Analysis of Security Protocols.
SAS 2001: 432-432 |
| 20 | | Ian Wakeman,
Alan Jeffrey,
Tim Owen,
Damyan Pepper:
SafetyNet: A language-based approach to programmable networks.
Computer Networks 36(1): 101-114 (2001) |
| 19 | | Andrew D. Gordon,
Alan Jeffrey:
Typing Correspondence Assertions for Communication Protocols.
Electr. Notes Theor. Comput. Sci. 45: (2001) |
| 2000 |
|---|
| 18 | | Alan Jeffrey,
Julian Rathke:
A Theory of Bisimulation for a Fragment of Concurrent ML with Local Names.
LICS 2000: 311-321 |
| 17 | | William Ferreira,
Matthew Hennessy,
Alan Jeffrey:
Combining the typed lambda-calculus with CCS.
Proof, Language, and Interaction 2000: 511-534 |
| 16 | | Alan Jeffrey:
Preface.
Electr. Notes Theor. Comput. Sci. 41(3): (2000) |
| 1999 |
|---|
| 15 | | Alan Jeffrey,
Julian Rathke:
Towards a Theory of Bisimulation for Local Names.
LICS 1999: 56-66 |
| 14 | | Ralf Schweimeier,
Alan Jeffrey:
A Categorical and Graphical Treatment of Closure Conversion.
Electr. Notes Theor. Comput. Sci. 20: (1999) |
| 13 | | Alan Jeffrey:
A Fully Abstract Semantics for a Higher-Order Functional Language with Nondeterministic Computation.
Theor. Comput. Sci. 228(1-2): 105-150 (1999) |
| 1998 |
|---|
| 12 | | William Ferreira,
Matthew Hennessy,
Alan Jeffrey:
A Theory of Weak Bisimulation for Core CML.
J. Funct. Program. 8(5): 447-491 (1998) |
| 1997 |
|---|
| 11 | | Alan Jeffrey:
Premonoidal categories and flow graphs.
Electr. Notes Theor. Comput. Sci. 10: (1997) |
| 1996 |
|---|
| 10 | | William Ferreira,
Matthew Hennessy,
Alan Jeffrey:
A Theory of Weak Bisimulation for Core CML.
ICFP 1996: 201-212 |
| 1995 |
|---|
| 9 | | Alan Jeffrey:
A Fully Abstract Semantics for a Concurrent Functional Language with Monadic Types
LICS 1995: 255-264 |
| 8 | | Alan Jeffrey:
A fully abstract semantics for a nondeterministic functional language with monadic types.
Electr. Notes Theor. Comput. Sci. 1: (1995) |
| 7 | | Luca Aceto,
Alan Jeffrey:
A Complete Axiomatization of Timed Bisimulation for a Class of Timed Regular Behaviours.
Theor. Comput. Sci. 152(2): 251-268 (1995) |
| 1994 |
|---|
| 6 | | Carolyn Brown,
Alan Jeffrey:
Allegories of Circuits.
LFCS 1994: 56-68 |
| 5 | | Alan Jeffrey:
A Fully Abstract Semantics for Concurrent Graph Reduction
LICS 1994: 82-91 |
| 1993 |
|---|
| 4 | | Alan Jeffrey:
A Chemical Abstract Machine for Graph Reduction.
MFPS 1993: 293-303 |
| 1992 |
|---|
| 3 | | Alan Jeffrey:
Translating Timed Process Algebra into Prioritized Process Algebra.
FTRTFT 1992: 493-506 |
| 1991 |
|---|
| 2 | | Alan Jeffrey:
A Linear Time Process Algebra.
CAV 1991: 432-442 |
| 1 | | Alan Jeffrey:
Abstract Timed Observation and Process Algebra.
CONCUR 1991: 332-345 |
