Alan
Jeffrey
FPL   |   CTI   |   DePaul

Research

Bibliography

Links

Teaching

Bibliography

Refereed Journal Articles

  1. A Theory of Bisimulation for a Fragment of Concurrent ML with Local Names. A. S. A. Jeffrey and J. Rathke. In Theoretical Computer Science. 2003. To appear. Available on-line.

  2. 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.

  3. Types and Effects for Asymmetric Cryptographic Protocols. A. D. Gordon and A. S. A. Jeffrey. In J. Computer Security. 2003. To appear. Available on-line.

  4. 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.

  5. 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.

  6. 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.

  7. 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.

  8. 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. 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.

  2. Contextual Equivalence for Higher-Order Pi-Calculus Revisited. A. S. A. Jeffrey and J. Rathke. In Proc. Mathematical Foundations of Programming Semantics. Elsevier. 2003. Available on-line.

  3. 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. Available on-line.

  4. 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 to appear in J. Computer Security. Available on-line.

  5. 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.

  6. 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.

  7. 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 has appeared in J. Computer Security 11(4). Available on-line.

  8. 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 has appeared in Theoretical Computer Science 300. Available on-line.

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

  10. 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. Available on-line.

  11. 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 to appear in Theoretical Computer Science. Available on-line.

  12. 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.

  13. 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.

  14. 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.

  15. 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).

  16. 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. Full version has appeared in Theoretical Computer Science 228. Available on-line.

  17. 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. Available on-line.

  18. 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.

  19. 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.

  20. 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.

  21. 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.

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

  23. 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!

Last modified Fri Oct 31 11:24:41 CST 2003