default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlan Jeffrey
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j19]Ben Greenman, Alan Jeffrey, Shriram Krishnamurthi, Mitesh Shah:
Privacy-Respecting Type Error Telemetry at Scale. Art Sci. Eng. Program. 8(3) (2024)- [i8]Ben Greenman, Alan Jeffrey, Shriram Krishnamurthi, Mitesh Shah:
Privacy-Respecting Type Error Telemetry at Scale. CoRR abs/2403.02409 (2024) - 2022
- [j18]Alan Jeffrey
, James Riely, Mark Batty, Simon Cooksey, Ilya Kaysin, Anton Podkopaev:
The leaky semicolon: compositional semantic dependencies for relaxed-memory concurrency. Proc. ACM Program. Lang. 6(POPL): 1-30 (2022) - 2021
- [i7]Lily Brown, Andy Friesen, Alan Jeffrey:
Position Paper: Goals of the Luau Type System. CoRR abs/2109.11397 (2021) - 2020
- [j17]Radha Jagadeesan, Alan Jeffrey, James Riely:
Pomsets with preconditions: a simple model of relaxed memory. Proc. ACM Program. Lang. 4(OOPSLA): 194:1-194:30 (2020)
2010 – 2019
- 2019
- [j16]Alan Jeffrey, James Riely:
On Thin Air Reads: Towards an Event Structures Model of Relaxed Memory. Log. Methods Comput. Sci. 15(1) (2019) - [c46]Craig Disselkoen, Radha Jagadeesan, Alan Jeffrey, James Riely:
The Code That Never Ran: Modeling Attacks on Speculative Evaluation. IEEE Symposium on Security and Privacy 2019: 1238-1255 - [i6]Omar S. Navarro Leija, Alan Jeffrey:
Lightweight Record-and-Replay for Intermittent Tests Failures. CoRR abs/1909.03111 (2019) - 2018
- [i5]Alan Jeffrey:
Josephine: Using JavaScript to safely manage the lifetimes of Rust data. CoRR abs/1807.00067 (2018) - 2017
- [i4]Alan Jeffrey, James Riely:
On Thin Air Reads: Towards an Event Structures Model of Relaxed Memory. CoRR abs/1707.05881 (2017) - 2016
- [j15]Matthew A. Goto, Radha Jagadeesan, Alan Jeffrey, Corin Pitcher, James Riely:
An extensible approach to session polymorphism. Math. Struct. Comput. Sci. 26(3): 465-509 (2016) - [c45]Alan Jeffrey, James Riely:
On Thin Air Reads Towards an Event Structures Model of Relaxed Memory. LICS 2016: 759-767 - [i3]Connor G. Brewster, Alan Jeffrey:
A Model of Navigation History. CoRR abs/1608.05444 (2016) - 2014
- [c44]Alan Jeffrey:
Functional reactive types. CSL-LICS 2014: 54:1-54:9 - 2013
- [c43]Alan Jeffrey:
Functional reactive programming with liveness guarantees. ICFP 2013: 233-244 - [c42]Peter J. Danielsen, Alan Jeffrey:
Validation and Interactivity of Web API Documentation. ICWS 2013: 523-530 - [c41]Alan Jeffrey:
Dependently Typed Web Client Applications - FRP in Agda in HTML5. PADL 2013: 228-243 - [c40]Alan Jeffrey:
Causality for free!: parametricity implies causality for functional reactive programs. PLPV 2013: 57-68 - 2012
- [c39]Alan Jeffrey:
LTL types FRP: linear-time temporal logic propositions as types, proofs as functional reactive programs. PLPV 2012: 49-60 - 2011
- [c38]Alan Jeffrey, Julian Rathke:
The Lax Braided Structure of Streaming I/O. CSL 2011: 292-306 - [c37]Alan Jeffrey, Peter F. Patel-Schneider:
Integrity Constraints for Linked Data. Description Logics 2011 - [c36]Andrew D. Gordon, Robert Harper, John Harrison, Alan Jeffrey, Peter Sewell:
Robin Milner 1934--2010: verification, languages, and concurrency. POPL 2011: 473-474
2000 – 2009
- 2009
- [c35]Radha Jagadeesan, Alan Jeffrey, Corin Pitcher, James Riely:
Towards a Theory of Accountability and Audit. ESORICS 2009: 152-167 - [c34]Alan Jeffrey, Taghrid Samak:
Model Checking Firewall Policy Configurations. POLICY 2009: 60-67 - 2008
- [j14]Radha Jagadeesan, Alan Jeffrey, Corin Pitcher, James Riely:
Lambda-RBAC: Programming with Role-Based Access Control. Log. Methods Comput. Sci. 4(1) (2008) - [j13]Alan Jeffrey, Julian Rathke:
Full abstraction for polymorphic pi-calculus. Theor. Comput. Sci. 390(2-3): 171-196 (2008) - [c33]Michael Benedikt, Alan Jeffrey, Ruy Ley-Wild:
Stream firewalling of xml constraints. SIGMOD Conference 2008: 487-498 - 2007
- [c32]Michael Benedikt, Alan Jeffrey:
Efficient and Expressive Tree Filters. FSTTCS 2007: 461-472 - [i2]Radha Jagadeesan, Alan Jeffrey, Corin Pitcher, James Riely:
Lambda-RBAC: Programming with Role-Based Access Control. CoRR abs/0712.1205 (2007) - 2006
- [j12]Christian Haack, Alan Jeffrey:
Pattern-matching spi-calculus. Inf. Comput. 204(8): 1195-1263 (2006) - [j11]Radha Jagadeesan, Alan Jeffrey, James Riely:
Typed parametric polymorphism for aspects. Sci. Comput. Program. 63(3): 267-296 (2006) - [c31]Radha Jagadeesan, Alan Jeffrey, Corin Pitcher, James Riely:
lambda-RBAC: Programming with Role-Based Access Control. ICALP (2) 2006: 456-467 - 2005
- [j10]Alan Jeffrey, Julian Rathke:
Contextual equivalence for higher-order pi-calculus revisited. Log. Methods Comput. Sci. 1(1) (2005) - [j9]Alan Jeffrey, Julian Rathke:
A fully abstract may testing semantics for concurrent objects. Theor. Comput. Sci. 338(1-3): 17-63 (2005) - [c30]Andrew D. Gordon, Alan Jeffrey:
Secrecy Despite Compromise: Types, Cryptography, and the Pi-Calculus. CONCUR 2005: 186-201 - [c29]Christian Haack, Alan Jeffrey:
Timed Spi-Calculus with Types for Secrecy and Authenticity. CONCUR 2005: 202-216 - [c28]Alan Jeffrey, Julian Rathke:
Java Jr: Fully Abstract Trace Semantics for a Core Java Language. ESOP 2005: 423-438 - [c27]Alan Jeffrey, Julian Rathke:
Full Abstraction for Polymorphic Pi-Calculus. FoSSaCS 2005: 266-281 - [i1]Alan Jeffrey, Julian Rathke:
Contextual equivalence for higher-order pi-calculus revisited. CoRR abs/cs/0503067 (2005) - 2004
- [j8]Andrew D. Gordon, Alan Jeffrey:
Types and effects for asymmetric cryptographic protocols. J. Comput. Secur. 12(3-4): 435-483 (2004) - [j7]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) - [c26]Glenn Bruns, Radha Jagadeesan, Alan Jeffrey, James Riely:
µABC: A Minimal Aspect Calculus. CONCUR 2004: 209-224 - [c25]Christian Haack, Alan Jeffrey:
Pattern-Matching Spi-Calculus. Formal Aspects in Security and Trust 2004: 55-70 - 2003
- [j6]Andrew D. Gordon, Alan Jeffrey:
Authenticity by Typing for Security Protocols. J. Comput. Secur. 11(4): 451-520 (2003) - [j5]Andrew D. Gordon, Alan Jeffrey:
Typing correspondence assertions for communication protocols. Theor. Comput. Sci. 300(1-3): 379-409 (2003) - [c24]Radha Jagadeesan, Alan Jeffrey, James Riely:
A Calculus of Untyped Aspect-Oriented Programs. ECOOP 2003: 54-73 - [c23]Alan Jeffrey, Julian Rathke:
Contextual Equivalence for Higher-Order π-Calculus Revisited. MFPS 2003: 149-168 - 2002
- [c22]Andrew D. Gordon, Alan Jeffrey:
Types and Effects for Asymmetric Cryptographic Protocols. CSFW 2002: 77-91 - [c21]Andrew D. Gordon, Alan Jeffrey:
Typing One-to-One and One-to-Many Correspondences in Security Protocols. ISSS 2002: 263-282 - [c20]Alan Jeffrey, Julian Rathke:
A Fully Abstract May Testing Semantics for Concurrent Objects. LICS 2002: 101-112 - 2001
- [j4]Ian Wakeman, Alan Jeffrey, Tim Owen, Damyan Pepper:
SafetyNet: A language-based approach to programmable networks. Comput. Networks 36(1): 101-114 (2001) - [c19]Andrew D. Gordon, Alan Jeffrey:
Authenticity by Typing for Security Protocols. CSFW 2001: 145-159 - [c18]Alan Jeffrey:
A Symbolic Labelled Transition System for Coinductive Subtyping of Fµ< Types. LICS 2001: 323-333 - [c17]Andrew D. Gordon, Alan Jeffrey:
A Type and Effect Analysis of Security Protocols. SAS 2001: 432-432 - [c16]Andrew D. Gordon, Alan Jeffrey:
Typing Correspondence Assertions for Communication Protocols. MFPS 2001: 119-140 - 2000
- [c15]William Ferreira, Matthew Hennessy, Alan Jeffrey:
Combining the typed lambda-calculus with CCS. Proof, Language, and Interaction 2000: 511-534 - [c14]Alan Jeffrey, Julian Rathke:
A Theory of Bisimulation for a Fragment of Concurrent ML with Local Names. LICS 2000: 311-321 - [c13]Alan Jeffrey:
Preface. HOOTS 2000: 89 - [e1]Alan Jeffrey:
4th International Workshop on Higher Order Operational Techniques in Semantics, HOOTS 2000, Satellite to PLI 2000, Montreal, Canada, September 22, 2000. Electronic Notes in Theoretical Computer Science 41(3), Elsevier 2000 [contents]
1990 – 1999
- 1999
- [j3]Alan Jeffrey:
A Fully Abstract Semantics for a Higher-Order Functional Language with Nondeterministic Computation. Theor. Comput. Sci. 228(1-2): 105-150 (1999) - [c12]Alan Jeffrey, Julian Rathke:
Towards a Theory of Bisimulation for Local Names. LICS 1999: 56-66 - [c11]Ralf Schweimeier, Alan Jeffrey:
A Categorical and Graphical Treatment of Closure Conversion. MFPS 1999: 481-511 - 1998
- [j2]William Ferreira, Matthew Hennessy, Alan Jeffrey:
A Theory of Weak Bisimulation for Core CML. J. Funct. Program. 8(5): 447-491 (1998) - 1997
- [c10]Alan Jeffrey:
Premonoidal categories and flow graphs. HOOTS 1997: 51 - 1996
- [c9]William Ferreira, Matthew Hennessy, Alan Jeffrey:
A Theory of Weak Bisimulation for Core CML. ICFP 1996: 201-212 - 1995
- [b1]Alan Jeffrey:
Handbook of mathematical formulas and integrals. Academic Press 1995, ISBN 978-0-12-382580-3, pp. I-XXIV, 1-410 - [j1]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) - [c8]Alan Jeffrey:
A Fully Abstract Semantics for a Concurrent Functional Language with Monadic Types. LICS 1995: 255-264 - [c7]Alan Jeffrey:
A fully abstract semantics for a nondeterministic functional language with monadic types. MFPS 1995: 290-301 - 1994
- [c6]Carolyn Brown, Alan Jeffrey:
Allegories of Circuits. LFCS 1994: 56-68 - [c5]Alan Jeffrey:
A Fully Abstract Semantics for Concurrent Graph Reduction. LICS 1994: 82-91 - 1993
- [c4]Alan Jeffrey:
A Chemical Abstract Machine for Graph Reduction. MFPS 1993: 293-303 - 1992
- [c3]Alan Jeffrey:
Translating Timed Process Algebra into Prioritized Process Algebra. FTRTFT 1992: 493-506 - 1991
- [c2]Alan Jeffrey:
A Linear Time Process Algebra. CAV 1991: 432-442 - [c1]Alan Jeffrey:
Abstract Timed Observation and Process Algebra. CONCUR 1991: 332-345
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-10 00:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
