Alan Jeffrey

Orcid: 0000-0001-6342-0318

According to our database1, Alan Jeffrey authored at least 61 papers between 1991 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Privacy-Respecting Type Error Telemetry at Scale.
Art Sci. Eng. Program., 2024

2022
The leaky semicolon: compositional semantic dependencies for relaxed-memory concurrency.
Proc. ACM Program. Lang., 2022

2021
Position Paper: Goals of the Luau Type System.
CoRR, 2021

2020
Pomsets with preconditions: a simple model of relaxed memory.
Proc. ACM Program. Lang., 2020

2019
On Thin Air Reads: Towards an Event Structures Model of Relaxed Memory.
Log. Methods Comput. Sci., 2019

Lightweight Record-and-Replay for Intermittent Tests Failures.
CoRR, 2019

The Code That Never Ran: Modeling Attacks on Speculative Evaluation.
Proceedings of the 2019 IEEE Symposium on Security and Privacy, 2019

2018
Josephine: Using JavaScript to safely manage the lifetimes of Rust data.
CoRR, 2018

2016
An extensible approach to session polymorphism.
Math. Struct. Comput. Sci., 2016

A Model of Navigation History.
CoRR, 2016

2014
Functional reactive types.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013
Causality for free!: parametricity implies causality for functional reactive programs.
Proceedings of the 7th Workshop on Programming languages meets program verification, 2013

Dependently Typed Web Client Applications - FRP in Agda in HTML5.
Proceedings of the Practical Aspects of Declarative Languages, 2013

Validation and Interactivity of Web API Documentation.
Proceedings of the 2013 IEEE 20th International Conference on Web Services, Santa Clara, CA, USA, June 28, 2013

Functional reactive programming with liveness guarantees.
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2013

2012
LTL types FRP: linear-time temporal logic propositions as types, proofs as functional reactive programs.
Proceedings of the sixth workshop on Programming Languages meets Program Verification, 2012

2011
Robin Milner 1934--2010: verification, languages, and concurrency.
Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2011

Integrity Constraints for Linked Data.
Proceedings of the 24th International Workshop on Description Logics (DL 2011), 2011

The Lax Braided Structure of Streaming I/O.
Proceedings of the Computer Science Logic, 2011

2009
Model Checking Firewall Policy Configurations.
Proceedings of the POLICY 2009, 2009

Towards a Theory of Accountability and Audit.
Proceedings of the Computer Security, 2009

2008
Full abstraction for polymorphic pi-calculus.
Theor. Comput. Sci., 2008

Lambda-RBAC: Programming with Role-Based Access Control.
Log. Methods Comput. Sci., 2008

Stream firewalling of xml constraints.
Proceedings of the ACM SIGMOD International Conference on Management of Data, 2008

2007
Efficient and Expressive Tree Filters.
Proceedings of the FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science, 2007

2006
Typed parametric polymorphism for aspects.
Sci. Comput. Program., 2006

Pattern-matching spi-calculus.
Inf. Comput., 2006

<i>lambda</i>-RBAC: Programming with Role-Based Access Control.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005
A fully abstract may testing semantics for concurrent objects.
Theor. Comput. Sci., 2005

Contextual equivalence for higher-order pi-calculus revisited.
Log. Methods Comput. Sci., 2005

Java Jr: Fully Abstract Trace Semantics for a Core Java Language.
Proceedings of the Programming Languages and Systems, 2005

Timed Spi-Calculus with Types for Secrecy and Authenticity.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

Secrecy Despite Compromise: Types, Cryptography, and the Pi-Calculus.
Proceedings of the CONCUR 2005 - Concurrency Theory, 16th International Conference, 2005

2004
A theory of bisimulation for a fragment of concurrent ML with local names.
Theor. Comput. Sci., 2004

Types and effects for asymmetric cryptographic protocols.
J. Comput. Secur., 2004

µABC: A Minimal Aspect Calculus.
Proceedings of the CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31, 2004

2003
Typing correspondence assertions for communication protocols.
Theor. Comput. Sci., 2003

Authenticity by Typing for Security Protocols.
J. Comput. Secur., 2003

Contextual Equivalence for Higher-Order π-Calculus Revisited.
Proceedings of 19th Conference on the Mathematical Foundations of Programming Semantics, 2003

A Calculus of Untyped Aspect-Oriented Programs.
Proceedings of the ECOOP 2003, 2003

2002
Typing One-to-One and One-to-Many Correspondences in Security Protocols.
Proceedings of the Software Security -- Theories and Systems, 2002

2001
SafetyNet: A language-based approach to programmable networks.
Comput. Networks, 2001

A Type and Effect Analysis of Security Protocols.
Proceedings of the Static Analysis, 8th International Symposium, 2001

A Symbolic Labelled Transition System for Coinductive Subtyping of <i>F<sub>µ<</sub></i> Types.
Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science, 2001

2000
Preface.
Proceedings of the 4th International Workshop on Higher Order Operational Techniques in Semantics, 2000

Combining the typed lambda-calculus with CCS.
Proceedings of the Proof, Language, and Interaction, Essays in Honour of Robin Milner, 2000

1999
A Fully Abstract Semantics for a Higher-Order Functional Language with Nondeterministic Computation.
Theor. Comput. Sci., 1999

A Categorical and Graphical Treatment of Closure Conversion.
Proceedings of the Fifteenth Conference on Mathematical Foundations of Progamming Semantics, 1999

Towards a Theory of Bisimulation for Local Names.
Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

1998
A Theory of Weak Bisimulation for Core CML.
J. Funct. Program., 1998

1997
Premonoidal categories and flow graphs.
Proceedings of the Second Workshop on Higher-Order Operational Techniques in Semantics, 1997

1995
A Complete Axiomatization of Timed Bisimulation for a Class of Timed Regular Behaviours.
Theor. Comput. Sci., 1995

A fully abstract semantics for a nondeterministic functional language with monadic types.
Proceedings of the Eleventh Annual Conference on Mathematical Foundations of Programming Semantics, 1995

A Fully Abstract Semantics for a Concurrent Functional Language with Monadic Types
Proceedings of the Proceedings, 1995

Handbook of mathematical formulas and integrals.
Academic Press, ISBN: 978-0-12-382580-3, 1995

1994
A Fully Abstract Semantics for Concurrent Graph Reduction
Proceedings of the Ninth Annual Symposium on Logic in Computer Science (LICS '94), 1994

Allegories of Circuits.
Proceedings of the Logical Foundations of Computer Science, Third International Symposium, 1994

1993
A Chemical Abstract Machine for Graph Reduction.
Proceedings of the Mathematical Foundations of Programming Semantics, 1993

1992
Translating Timed Process Algebra into Prioritized Process Algebra.
Proceedings of the Formal Techniques in Real-Time and Fault-Tolerant Systems, 1992

1991
Abstract Timed Observation and Process Algebra.
Proceedings of the CONCUR '91, 1991

A Linear Time Process Algebra.
Proceedings of the Computer Aided Verification, 3rd International Workshop, 1991


  Loading...