Alan
Jeffrey 		Bell Labs   |   Alcatel-Lucent  

Research

Bibliography

Cryptyc

Temporal Aspects

Full Abstraction Factory

Bibliography

Also available as a BibTeX database.

Refereed Journal Articles

  1. Full Abstraction for Polymorphic Pi-Calculus. A. S. A. Jeffrey and J. Rathke. In Theoretical Computer Science. 2008. To appear. Available on-line.

  2. Lambda RBAC: Programming with Role-Based Access Control. R. Jagadeesan, A. S. A. Jeffrey, C. Pitcher and J. Riely. In Logical Methods In Computer Science. 2008. To appear. Available on-line.

  3. Pattern-Matching Spi-Calculus. C. Haack and A. S. A. Jeffrey. In Information and Computation. 204 (8). 2006. pp. 1195-1263. Available on-line.

  4. Typed Parametric Polymorphism for Aspects. R. Jagadeesan, A. S. A. Jeffrey and J. Riely. In Science of Computer Programming. 63 (3). 2006. pp. 267--296. Available on-line.

  5. A Fully Abstract May Testing Semantics for Concurrent Objects. A. S. A. Jeffrey and J. Rathke. In Theoretical Computer Science. vol. 338. 2005. pp. 17-63. Available on-line.

  6. Contextual Equivalence for Higher-Order Pi-Calculus Revisited. A. S. A. Jeffrey and J. Rathke. In Logical Methods in Computer Science. 1 (1:4). 2005. pp. 1-22. Available on-line.

  7. A Theory of Bisimulation for a Fragment of Concurrent ML with Local Names. A. S. A. Jeffrey and J. Rathke. In Theoretical Computer Science. vol. 323. 2004. pp. 1-48. Available on-line.

  8. Types and Effects for Asymmetric Cryptographic Protocols. A. D. Gordon and A. S. A. Jeffrey. In J. Computer Security. 12 (3/4). 2004. pp. 435-484. Available on-line.

  9. Authenticity by Typing for Security Protocols. A. D. Gordon and A. S. A. Jeffrey. In J. Computer Security. 11 (4). 2003. pp. 451-521. Available on-line.

  10. Typing Correspondence Assertions for Communication Protocols. A. D. Gordon and A. S. A. Jeffrey. In Theoretical Computer Science. vol. 300. 2003. pp. 379-409. Available on-line.

  11. SafetyNet: A Language-Based Approach to Programmable Networks. I. Wakeman, A. S. A. Jeffrey, T. Owen and D. Pepper. In Computer Networks and ISDN Systems. 36 (1). 2001.

  12. A Fully Abstract Semantics for a Nondeterministic Functional Language with Monadic Types. A. S. A. Jeffrey. In Theoretical Computer Science. vol. 228. 1999. pp. 105-150. Available on-line.

  13. A Theory of Weak Bisimulation for Core CML. W. Ferreira, M. Hennessy and A. S. A. Jeffrey. In J. Functional Programming. 8 (5). 1998. pp. 447-491. Available on-line.

  14. A Complete Axiomatization of Timed Bisimulation for a Class of Timed Regular Behaviours. L. Aceto and A. S. A. Jeffrey. In Theoretical Computer Science. vol. 152. 1995. pp. 251--268. Available on-line.

Refereed Conference and Workshop Articles

  1. Efficient and Expressive Tree Filters. M. Benedikt and A. S. A. Jeffrey. In Proc. Foundations of Software Technology and Theoretical Computer Science. Springer-Verlag. 2007. To appear. Available on-line.

  2. Dynamic Model Checking of C Cryptographic Protocol Implementations. A. S. A. Jeffrey and R. Ley-Wild. In Proc. Workshop on Foundations of Computer Security and Automated Reasoning for Security Protocol Analysis. 2006. Available on-line.

  3. Lambda-RBAC: Programming with Role-Based Access Control. In Proc. Int. Colloq. Automata, Languages and Programming. Springer-Verlag. 2006. pp. 456-467. Available on-line.

  4. Full Abstraction for Polymorphic Pi-Calculus. A. S. A. Jeffrey and J. Rathke. In Proc. Foundations of Software Science and Computation Structures. Springer-Verlag. 2005. pp. 266-281. Full version to appear in Theoretical Computer Science. Available on-line.

  5. Java Jr.: Fully Abstract Trace Semantics for a Core Java Language. A. S. A. Jeffrey and J. Rathke. In Proc. European Symposium on Programming. Springer-Verlag. 2005. pp. 423-438. Available on-line.

  6. Secrecy Despite Compromise: Types, Cryptography, and the Pi-Calculus. A. D. Gordon and A. S. A. Jeffrey. In Proc. Concur. Springer-Verlag. 2005. pp. 186-201. Available on-line.

  7. Timed Spi-calculus with Types for Secrecy and Authenticity. C. Haack and A. S. A. Jeffrey. In Proc. Concur. Springer-Verlag. 2005. pp. 202-216. Available on-line.

  8. muABC: A Minimal Aspect Calculus. G. Bruns, R. Jagadeesan, A. S. A. Jeffrey and J. Riely. In Proc. Concur. Springer-Verlag. 2004. pp. 209--224. Available on-line.

  9. Pattern-Matching Spi-Calculus. C. Haack and A. S. A. Jeffrey. In Proc. IFIP WG 1.7 Workshop on Formal Aspects in Security and Trust. 2004. Full version appeared in Information and Computation 204(8). Available on-line.

  10. A Calculus of Untyped Aspect-Oriented Programs. R. Jagadeesan, A. S. A. Jeffrey and J. Riely. In Proc. European Conf. Object-Oriented Programming. Springer-Verlag. 2003. pp. 415--427. Available on-line.

  11. Contextual Equivalence for Higher-Order Pi-Calculus Revisited. A. S. A. Jeffrey and J. Rathke. In Proc. Mathematical Foundations of Programming Semantics. Elsevier. 2003. Full version appeared in Logical Methods in Computer Science 1 (1:4). Available on-line.

  12. A Fully Abstract May Testing Semantics for Concurrent Objects. A. S. A. Jeffrey and J. Rathke. In Proc. IEEE Logic In Computer Science. IEEE Press. 2002. pp. 101-112. Full version appeared in Theoretical Computer Science 338. Available on-line.

  13. Types and Effects for Asymmetric Cryptographic Protocols. A. D. Gordon and A. S. A. Jeffrey. In Proc. IEEE Computer Security Foundations Workshop. IEEE Press. 2002. pp. 77-91. Full version appeared in J. Computer Security 12(3/4). Available on-line.

  14. Typing One-to-One and One-to-Many Correspondences in Security Protocols. A. D. Gordon and A. S. A. Jeffrey. In Proc. Int. Software Security Symp.. Springer-Verlag. 2002. pp. 263-282. Available on-line.

  15. Authenticity by Typing for Security Protocols. A. D. Gordon and A. S. A. Jeffrey. In Proc. IEEE Computer Security Foundations Workshop. IEEE Press. 2001. pp. 145-159. Full version appeared in J. Computer Security 11(4). Available on-line.

  16. A Symbolic Labelled Transition System for Coinductive Subytping of F-mu-sub Types. A. S. A. Jeffrey. In Proc. IEEE Logic in Computer Science. IEEE Press. 2001. pp. 323-333. Available on-line.

  17. Typing Correspondence Assertions for Communication Protocols. A. D. Gordon and A. S. A. Jeffrey. In Proc. Mathematical Foundations of Programming Semantics. Elsevier. 2001. Full version appeared in Theoretical Computer Science 300. Available on-line.

  18. A Distributed Object Calculus. A. S. A. Jeffrey. In Proc. Foundations of Object Oriented Languages. 2000. Available on-line.

  19. A Language-Based Approach to Programmable Networks. I. Wakeman, A. S. A. Jeffrey and T. Owen. In Proc. IEEE Open Architectures and Network Programming. IEEE Press. 2000. pp. 128-138. Full version appeared in Computer Networks and ISDN Systems 36(1). Available on-line.

  20. A Theory of Bisimulation for a Fragment of Concurrent ML with Local Names. A. S. A. Jeffrey and J. Rathke. In Proc. IEEE Logic in Computer Science. IEEE Press. 2000. pp. 311-321. Full version appeared in Theoretical Computer Science 323. Available on-line.

  21. Compilation of Higher-Order Languages in Graphical Form. R. Schweimeier and A. S. A. Jeffrey. In Proc. Mathemtical Foundations of Programming Semantics. Elsevier. 1999. Available on-line.

  22. Towards a Theory of Bisimulation for Local Names. A. S. A. Jeffrey and J. Rathke. In Proc. IEEE Logic in Computer Science. IEEE Press. 1999. pp. 56--66. Available on-line.

  23. Semantics for Core Concurrent ML Using Computation Types. A. S. A. Jeffrey. In Proc. Higher Order Operational Techniques in Semantics. Cambridge University Press. 1997. pp. 55-89. Available on-line.

  24. A Theory of Weak Bisimulation for Core CML. W. Ferreira, M. Hennessy and A.S.A. Jeffrey. In Proc. ACM Int. Conf. Functional Programming. ACM Press. 1996. pp. 201-212. Full version has appeared in J. Functional Programming 8(5).

  25. A Fully Abstract Semantics for a Concurrent Functional Language with Monadic Types. A. S. A. Jeffrey. In Proc. IEEE Logic in Computer Science. IEEE Press. 1995. pp. 255--264. Available on-line.

  26. A Fully Abstract Semantics for a Nondeterministic Functional Language with Monadic Types. A. S. A. Jeffrey. In Proc. Mathematical Foundations of Programming Semantics. Elsevier. 1995. Full version has appeared in Theoretical Computer Science 228. Available on-line.

  27. Allegories of Circuits. C. Brown and A. S. A. Jeffrey. In Proc. Logical Foundations of Computer Science. Springer-Verlag. 1994. pp. 56-68. Available on-line.

  28. A Fully Abstract Semantics for Concurrent Graph Reduction. A. S. A. Jeffrey. In Proc. IEEE Logic in Computer Science. IEEE Press. 1994. pp. 82-91. Available on-line.

  29. A Chemical Abstract Machine for Graph Reduction. A. S. A. Jeffrey. In Proc. Mathematical Foundations of Programming Semantics. Springer-Verlag. 1993. pp. 293-303. Available on-line.

  30. Translating Timed Process Algebra into Prioritized Process Algebra. A. S. A. Jeffrey. In Proc. Formal Techniques in Real-Time and Fault-Tolerant systems. Springer-Verlag. 1992. pp. 493-506.

  31. Abstract Timed Observation and Process Algebra. A. S. A. Jeffrey. In Proc. Concur. Springer-Verlag. 1991. pp. 332--345.

  32. A Linear Time Process Algebra. A. S. A. Jeffrey. In Proc. Computer Aided Verification. Springer-Verlag. 1991. pp. 432--442.

Other Publications

  1. Combining the Typed Lambda-Calculus with CCS. In Proof, Language and Interaction: Essays in Honour of Robin Milner. W. Ferreira, M. Hennessy and A. S. A. Jeffrey. Editted by G. Plotkin and C. Stirling and M. Tofte. MIT Press. 2000. Available on-line.

  2. Flow Graphs and Semantics of Programs. A. S. A. Jeffrey. CTI, DePaul University. 98-004. Technical Report. 1998. Available on-line.

  3. A Core Data and Behaviour Language for E-LOTOS. A. S. A. Jeffrey. 1996. Input document to ISO SC21 Kansas meeting. Available on-line.

  4. E-LOTOS Core Language. A. S. A. Jeffrey and G. Leduc. 1996. Output document from ISO SC21 Kansas meeting. Available on-line.

  5. Fontinst: Font Installation Software for TeX. A. S. A. Jeffrey, et al. 1996. Available on-line.

  6. LaTeX2e for Authors. J. Brahms, D. Carlisle, A. S. A. Jeffrey, F. Mittelbach, C. Rowley and and R. Schöpf. The LaTeX3 Project. 1995. Available on-line.

  7. LaTeX2e for Class and Package Writers. J. Brahms, D. Carlisle, A. S. A. Jeffrey, F. Mittelbach, C. Rowley and and R. Schöpf. The LaTeX3 Project. 1995. Available on-line.

  8. Semantics for a Fragment of LOTOS with Functional Data and Abstract Datatypes. In Revised Working Draft on Enhancements to LOTOS (v3). A. S. A. Jeffrey. International Standards Organization. 1995. Available on-line.

  9. Towards a Proposal for Datatypes in E-LOTOS. In Revised Working Draft on Enhancements to LOTOS (v2). A. S. A. Jeffrey, H. Garavel, G. Leduc, C. Pecheur and M. Sighireanu. International Standards Organization. 1995. Available on-line.

  10. PostScript Fonts in LaTeX. A. S. A. Jeffrey. In Proc. TeX Users Group AGM. 1994. pp. 263--268. Available on-line.

  11. A Comparison of Additivity Axioms in Timed Transition Systems. A. S. A. Jeffrey, S. A. Schneider and F. Vaandrager. University of Sussex. 11/93. Computer Science Technical Report. 1993. Available on-line.

  12. A PostScript Font Installation Package Written in TeX. A. S. A. Jeffrey. In Proc. TeX Users Group AGM. 1993. pp. 285--292. Available on-line.

  13. A typed, prioritized process algebra. A. S. A. Jeffrey. University of Sussex. 13/93. Computer Science Technical Report. 1993. Available on-line.

  14. Observation Spaces and Timed Processes. A. S. A. Jeffrey. D.Phil thesis. Oxford University. 1992.

Valid HTML 4.01!

Edited 29 November 2007.
Copyright © 2000-2004 Alan Jeffrey; 2004-2007 Alcatel-Lucent.