Alan Jeffrey
Alan Jeffrey
Mozilla Research
Verifierad e-postadress på mozilla.com - Startsida
TitelCiteras avÅr
Authenticity by typing for security protocols
AD Gordon, A Jeffrey
Journal of computer security 11 (4), 451-519, 2003
3062003
Types and effects for asymmetric cryptographic protocols
AD Gordon, A Jeffrey
Computer Security Foundations Workshop, 2002. Proceedings. 15th IEEE, 77-91, 2002
1962002
Towards a theory of accountability and audit
R Jagadeesan, A Jeffrey, C Pitcher, J Riely
Computer Security–ESORICS 2009, 152-167, 2009
1172009
Java Jr: Fully abstract trace semantics for a core Java language
A Jeffrey, J Rathke
Programming Languages and Systems, 423-438, 2005
1052005
A fully abstract may testing semantics for concurrent objects
A Jeffrey, J Rathke
IEEE Logic in Computer Science, 101-112, 2002
1012002
A calculus of untyped aspect-oriented programs
R Jagadeesan, A Jeffrey, J Riely
ECOOP 2003--Object-Oriented Programming, 54-73, 2003
832003
Contextual equivalence for higher-order pi-calculus revisited
A Jeffrey, J Rathke
Logical Methods in Computer Science 1 (1), 2005
812005
Typing correspondence assertions for communication protocols
AD Gordon, A Jeffrey
Theoretical Computer Science 300 (1-3), 379-409, 2003
782003
A theory of weak bisimulation for core CML
W Ferreira, M Hennessy, A Jeffrey
Journal of Functional Programming 8 (05), 447-491, 1998
781998
Model checking firewall policy configurations
A Jeffrey, T Samak
Policies for Distributed Systems and Networks, 2009. POLICY 2009. IEEE …, 2009
682009
Towards a theory of bisimulation for local names
A Jeffrey, J Rathke
Logic in Computer Science, 1999. Proceedings. 14th Symposium on, 56-66, 1999
601999
μABC: A minimal aspect calculus
G Bruns, R Jagadeesan, A Jeffrey, J Riely
CONCUR 2004-Concurrency Theory, 209-224, 2004
552004
Pattern-matching spi-calculus
C Haack, A Jeffrey
Formal Aspects in Security and Trust, 55-70, 2005
542005
LTL types FRP: Linear-time Temporal Logic Propositions as Types, Proofs as Functional Reactive Programs
A Jeffrey
ACM Workshop Programming Languages meets Program Verification, 2012
512012
Typed parametric polymorphism for aspects
R Jagadeesan, A Jeffrey, J Riely
Science of Computer Programming 63 (3), 267-296, 2006
512006
A theory of bisimulation for a fragment of concurrent ML with local names
A Jeffrey, J Rathke
Logic in Computer Science, 2000. Proceedings. 15th Annual IEEE Symposium on …, 2000
50*2000
Secrecy despite compromise: Types, cryptography, and the pi-calculus
A Gordon, A Jeffrey
CONCUR 2005–Concurrency Theory, 186-201, 2005
482005
Typing correspondence assertions for communication protocols
AD Gordon, A Jeffrey
Electronic Notes in Theoretical Computer Science 45, 119-140, 2001
482001
On Thin Air Reads: Towards an Event Structures Model of Relaxed Memory
A Jeffrey, J Riely
IEEE Logic in Computer Science, 2016
382016
Pattern-matching spi-calculus
C Haack, A Jeffrey
Information and Computation 204 (8), 1195-1263, 2006
372006
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20