The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Alan Jeffrey: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Alan Jeffrey
    A Linear Time Process Algebra. [Citation Graph (0, 0)][DBLP]
    CAV, 1991, pp:432-442 [Conf]
  2. Glenn Bruns, Radha Jagadeesan, Alan Jeffrey, James Riely
    µABC: A Minimal Aspect Calculus. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2004, pp:209-224 [Conf]
  3. Andrew D. Gordon, Alan Jeffrey
    Secrecy Despite Compromise: Types, Cryptography, and the Pi-Calculus. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:186-201 [Conf]
  4. Alan Jeffrey
    Abstract Timed Observation and Process Algebra. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1991, pp:332-345 [Conf]
  5. Christian Haack, Alan Jeffrey
    Timed Spi-Calculus with Types for Secrecy and Authenticity. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:202-216 [Conf]
  6. Andrew D. Gordon, Alan Jeffrey
    Authenticity by Typing for Security Protocols. [Citation Graph (0, 0)][DBLP]
    CSFW, 2001, pp:145-159 [Conf]
  7. Andrew D. Gordon, Alan Jeffrey
    Types and Effects for Asymmetric Cryptographic Protocols. [Citation Graph (0, 0)][DBLP]
    CSFW, 2002, pp:77-91 [Conf]
  8. Radha Jagadeesan, Alan Jeffrey, James Riely
    A Calculus of Untyped Aspect-Oriented Programs. [Citation Graph (0, 0)][DBLP]
    ECOOP, 2003, pp:54-73 [Conf]
  9. Alan Jeffrey, Julian Rathke
    Java Jr: Fully Abstract Trace Semantics for a Core Java Language. [Citation Graph (0, 0)][DBLP]
    ESOP, 2005, pp:423-438 [Conf]
  10. Alan Jeffrey, Julian Rathke
    Full Abstraction for Polymorphic Pi-Calculus. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2005, pp:266-281 [Conf]
  11. Alan Jeffrey
    Translating Timed Process Algebra into Prioritized Process Algebra. [Citation Graph (0, 0)][DBLP]
    FTRTFT, 1992, pp:493-506 [Conf]
  12. Radha Jagadeesan, Alan Jeffrey, Corin Pitcher, James Riely
    lambda-RBAC: Programming with Role-Based Access Control. [Citation Graph (0, 0)][DBLP]
    ICALP (2), 2006, pp:456-467 [Conf]
  13. William Ferreira, Matthew Hennessy, Alan Jeffrey
    A Theory of Weak Bisimulation for Core CML. [Citation Graph (0, 0)][DBLP]
    ICFP, 1996, pp:201-212 [Conf]
  14. Christian Haack, Alan Jeffrey
    Pattern-Matching Spi-Calculus. [Citation Graph (0, 0)][DBLP]
    Formal Aspects in Security and Trust, 2004, pp:55-70 [Conf]
  15. Andrew D. Gordon, Alan Jeffrey
    Typing One-to-One and One-to-Many Correspondences in Security Protocols. [Citation Graph (0, 0)][DBLP]
    ISSS, 2002, pp:263-282 [Conf]
  16. Carolyn Brown, Alan Jeffrey
    Allegories of Circuits. [Citation Graph (0, 0)][DBLP]
    LFCS, 1994, pp:56-68 [Conf]
  17. Alan Jeffrey
    A Symbolic Labelled Transition System for Coinductive Subtyping of Fµ< Types. [Citation Graph (0, 0)][DBLP]
    LICS, 2001, pp:323-333 [Conf]
  18. Alan Jeffrey
    A Fully Abstract Semantics for Concurrent Graph Reduction [Citation Graph (0, 0)][DBLP]
    LICS, 1994, pp:82-91 [Conf]
  19. Alan Jeffrey
    A Fully Abstract Semantics for a Concurrent Functional Language with Monadic Types [Citation Graph (0, 0)][DBLP]
    LICS, 1995, pp:255-264 [Conf]
  20. Alan Jeffrey, Julian Rathke
    A Theory of Bisimulation for a Fragment of Concurrent ML with Local Names. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:311-321 [Conf]
  21. Alan Jeffrey, Julian Rathke
    A Fully Abstract May Testing Semantics for Concurrent Objects. [Citation Graph (0, 0)][DBLP]
    LICS, 2002, pp:101-112 [Conf]
  22. Alan Jeffrey, Julian Rathke
    Towards a Theory of Bisimulation for Local Names. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:56-66 [Conf]
  23. Alan Jeffrey
    A Chemical Abstract Machine for Graph Reduction. [Citation Graph (0, 0)][DBLP]
    MFPS, 1993, pp:293-303 [Conf]
  24. Andrew D. Gordon, Alan Jeffrey
    A Type and Effect Analysis of Security Protocols. [Citation Graph (0, 0)][DBLP]
    SAS, 2001, pp:432-432 [Conf]
  25. Ian Wakeman, Alan Jeffrey, Tim Owen, Damyan Pepper
    SafetyNet: A language-based approach to programmable networks. [Citation Graph (0, 0)][DBLP]
    Computer Networks, 2001, v:36, n:1, pp:101-114 [Journal]
  26. Andrew D. Gordon, Alan Jeffrey
    Typing Correspondence Assertions for Communication Protocols. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:45, n:, pp:- [Journal]
  27. Alan Jeffrey
    Preface. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:41, n:3, pp:- [Journal]
  28. Alan Jeffrey
    A fully abstract semantics for a nondeterministic functional language with monadic types. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1995, v:1, n:, pp:- [Journal]
  29. Alan Jeffrey
    Premonoidal categories and flow graphs. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1997, v:10, n:, pp:- [Journal]
  30. Ralf Schweimeier, Alan Jeffrey
    A Categorical and Graphical Treatment of Closure Conversion. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1999, v:20, n:, pp:- [Journal]
  31. Christian Haack, Alan Jeffrey
    Pattern-matching spi-calculus. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2006, v:204, n:8, pp:1195-1263 [Journal]
  32. Andrew D. Gordon, Alan Jeffrey
    Types and effects for asymmetric cryptographic protocols. [Citation Graph (0, 0)][DBLP]
    Journal of Computer Security, 2004, v:12, n:3-4, pp:435-483 [Journal]
  33. Andrew D. Gordon, Alan Jeffrey
    Authenticity by Typing for Security Protocols. [Citation Graph (0, 0)][DBLP]
    Journal of Computer Security, 2003, v:11, n:4, pp:451-520 [Journal]
  34. William Ferreira, Matthew Hennessy, Alan Jeffrey
    A Theory of Weak Bisimulation for Core CML. [Citation Graph (0, 0)][DBLP]
    J. Funct. Program., 1998, v:8, n:5, pp:447-491 [Journal]
  35. Alan Jeffrey, Julian Rathke
    Contextual equivalence for higher-order pi-calculus revisited. [Citation Graph (0, 0)][DBLP]
    Logical Methods in Computer Science, 2005, v:1, n:1, pp:- [Journal]
  36. Radha Jagadeesan, Alan Jeffrey, James Riely
    Typed parametric polymorphism for aspects. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 2006, v:63, n:3, pp:267-296 [Journal]
  37. Luca Aceto, Alan Jeffrey
    A Complete Axiomatization of Timed Bisimulation for a Class of Timed Regular Behaviours. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:152, n:2, pp:251-268 [Journal]
  38. Andrew D. Gordon, Alan Jeffrey
    Typing correspondence assertions for communication protocols. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:300, n:1-3, pp:379-409 [Journal]
  39. Alan Jeffrey
    A Fully Abstract Semantics for a Higher-Order Functional Language with Nondeterministic Computation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:228, n:1-2, pp:105-150 [Journal]
  40. Alan Jeffrey, Julian Rathke
    A theory of bisimulation for a fragment of concurrent ML with local names. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:323, n:1-3, pp:1-48 [Journal]
  41. Alan Jeffrey, Julian Rathke
    A fully abstract may testing semantics for concurrent objects. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:338, n:1-3, pp:17-63 [Journal]
  42. Alan Jeffrey, Julian Rathke
    Contextual equivalence for higher-order pi-calculus revisited [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]

  43. Combining the typed lambda-calculus with CCS. [Citation Graph (, )][DBLP]


  44. Towards a Theory of Accountability and Audit. [Citation Graph (, )][DBLP]


  45. Efficient and Expressive Tree Filters. [Citation Graph (, )][DBLP]


  46. Model Checking Firewall Policy Configurations. [Citation Graph (, )][DBLP]


  47. Stream firewalling of xml constraints. [Citation Graph (, )][DBLP]


  48. Lambda-RBAC: Programming with Role-Based Access Control [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.009secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002