The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Matthew Hennessy: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Rance Cleaveland, Matthew Hennessy
    Testing Equivalence as a Bisimulation Equivalence. [Citation Graph (0, 0)][DBLP]
    Automatic Verification Methods for Finite State Systems, 1989, pp:11-23 [Conf]
  2. Matthew Hennessy, Xinxin Liu
    A Modal Logic for Message passing Processes (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CAV, 1993, pp:359-370 [Conf]
  3. Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn
    A Theory of Process with Localities (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:108-122 [Conf]
  4. Adrian Francalanza, Matthew Hennessy
    A Theory of System Behaviour in the Presence of Node and Link Failures. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2005, pp:368-382 [Conf]
  5. Matthew Hennessy
    Value-Passing in Process Algebras (Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:31- [Conf]
  6. Matthew Hennessy
    Concurrent Testing of Processes (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1992, pp:94-107 [Conf]
  7. Matthew Hennessy, H. Lin
    Proof Systems for Message-Passing Process Algebras. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1993, pp:202-216 [Conf]
  8. Matthew Hennessy, Julian Rathke
    Bisimulations for a Calculus of Broadcasting Systems. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1995, pp:486-500 [Conf]
  9. Nobuko Yoshida, Matthew Hennessy
    Suptyping and Locality in Distributed Higher Order Processes (extended abstract). [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:557-572 [Conf]
  10. Chrysafis Hartonas, Matthew Hennessy
    Full Abstractness for a Functional/Concurrent Language with Higher-Order Value-Passing (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    CSL, 1997, pp:239-254 [Conf]
  11. Matthew Hennessy, James Riely
    Type-Safe Execution of Mobile Agents in Anonymous Networks. [Citation Graph (0, 0)][DBLP]
    ECOOP Workshops, 1998, pp:304- [Conf]
  12. Matthew Hennessy, James Riely
    Type-Safe Execution of Mobile Agents in Anonymous Networks. [Citation Graph (0, 0)][DBLP]
    Secure Internet Programming, 1999, pp:95-115 [Conf]
  13. Matthew Hennessy
    Axiomatising Asynchronous Process Calculi (abstract). [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:90- [Conf]
  14. Alberto Ciaffaglione, Matthew Hennessy, Julian Rathke
    Proof Methodologies for Behavioural Equivalence in DPI. [Citation Graph (0, 0)][DBLP]
    FORTE, 2005, pp:335-350 [Conf]
  15. Matthew Hennessy, Tim Regan
    A Temporal Process Algebra. [Citation Graph (0, 0)][DBLP]
    FORTE, 1990, pp:33-48 [Conf]
  16. Adrian Francalanza, Matthew Hennessy
    A Theory for Observational Fault Tolerance. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2006, pp:16-31 [Conf]
  17. Matthew Hennessy, Massimo Merro, Julian Rathke
    Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2003, pp:282-298 [Conf]
  18. Matthew Hennessy, Julian Rathke, Nobuko Yoshida
    safeDpi: A Language for Controlling Mobile Code. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 2004, pp:241-256 [Conf]
  19. Ilaria Castellani, Matthew Hennessy
    Testing Theories for Asynchronous Languages. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:90-101 [Conf]
  20. Matthew Hennessy
    A Proof System for Communicating Processes with Value-passing (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1989, pp:325-339 [Conf]
  21. Matthew Hennessy
    Communication Primitives in Programming and Specification Languages. [Citation Graph (0, 0)][DBLP]
    Networking in Open Systems, 1986, pp:223-251 [Conf]
  22. Luca Aceto, Matthew Hennessy
    Adding Action Refinement to a Finite Process Algebra. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:506-519 [Conf]
  23. Matthew Hennessy
    An Algebraic Theory of Fair Asynchronous Communicating Processes. [Citation Graph (0, 0)][DBLP]
    ICALP, 1985, pp:260-269 [Conf]
  24. Matthew Hennessy
    Higher-Order Process and Their Models. [Citation Graph (0, 0)][DBLP]
    ICALP, 1994, pp:286-303 [Conf]
  25. Matthew Hennessy, Edward A. Ashcroft
    The Semantics of Nondeterminism. [Citation Graph (0, 0)][DBLP]
    ICALP, 1976, pp:478-493 [Conf]
  26. Matthew Hennessy, Anna Ingólfsdóttir
    A Theory of Communicating Processes with Value-Passing. [Citation Graph (0, 0)][DBLP]
    ICALP, 1990, pp:209-219 [Conf]
  27. Matthew Hennessy, Robin Milner
    On Observing Nondeterminism and Concurrency. [Citation Graph (0, 0)][DBLP]
    ICALP, 1980, pp:299-309 [Conf]
  28. Matthew Hennessy, James Riely
    Information Flow vs. Resource Access in the Asynchronous Pi-Calculus. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:415-427 [Conf]
  29. Rocco De Nicola, Matthew Hennessy
    Testing Equivalence for Processes. [Citation Graph (0, 0)][DBLP]
    ICALP, 1983, pp:548-560 [Conf]
  30. James Riely, Matthew Hennessy
    Distributed Processes and Location Failures (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:471-481 [Conf]
  31. Matthew Hennessy, W. Li, Gordon D. Plotkin
    A First Attempt at Translating CSP into CCS. [Citation Graph (0, 0)][DBLP]
    ICDCS, 1981, pp:105-115 [Conf]
  32. 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]
  33. Matthew Hennessy
    Synchronous and Asynchronous Experiments on Processes. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1983, pp:453-455 [Conf]
  34. Matthew Hennessy
    Proof Systems for Message-Passing Process Calculi. [Citation Graph (0, 0)][DBLP]
    IFM, 1999, pp:26- [Conf]
  35. Luca Aceto, Matthew Hennessy
    Towards Action-Refinement in Process Algebras [Citation Graph (0, 0)][DBLP]
    LICS, 1989, pp:138-145 [Conf]
  36. Rance Cleaveland, Matthew Hennessy
    Priorities in Process Algebras [Citation Graph (0, 0)][DBLP]
    LICS, 1988, pp:193-202 [Conf]
  37. Matthew Hennessy
    A Fully Abstract Denotational Model for Higher-Order Processes (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    LICS, 1993, pp:397-408 [Conf]
  38. Nobuko Yoshida, Matthew Hennessy
    Assigning Types to Processes. [Citation Graph (0, 0)][DBLP]
    LICS, 2000, pp:334-345 [Conf]
  39. Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn
    Observing Localities (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1991, pp:93-102 [Conf]
  40. William Ferreira, Matthew Hennessy
    Towards a Semantic Theory of CML (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1995, pp:454-466 [Conf]
  41. Matthew Hennessy
    Symbolic Bisimulations (Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1993, pp:83- [Conf]
  42. Matthew Hennessy, Gordon D. Plotkin
    Full Abstraction for a Simple Parallel Programming Language. [Citation Graph (0, 0)][DBLP]
    MFCS, 1979, pp:108-120 [Conf]
  43. Matthew Hennessy, Gordon D. Plotkin
    A Term Model for CCS. [Citation Graph (0, 0)][DBLP]
    MFCS, 1980, pp:261-274 [Conf]
  44. Matthew Hennessy, Colin Stirling
    The Power of the Future Perfect in Program Logics. [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:301-311 [Conf]
  45. Luca Aceto, Matthew Hennessy
    Termination, Deadlock and Divergence. [Citation Graph (0, 0)][DBLP]
    Mathematical Foundations of Programming Semantics, 1989, pp:301-318 [Conf]
  46. Massimo Merro, Matthew Hennessy
    Bisimulation congruences in safe ambients. [Citation Graph (0, 0)][DBLP]
    POPL, 2002, pp:71-80 [Conf]
  47. James Riely, Matthew Hennessy
    A Typed Language for Distributed Mobile Processes (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    POPL, 1998, pp:378-390 [Conf]
  48. James Riely, Matthew Hennessy
    Trust and Partial Typing in Open Systems of Mobile Agents. [Citation Graph (0, 0)][DBLP]
    POPL, 1999, pp:93-104 [Conf]
  49. Daniele Gorla, Matthew Hennessy, Vladimiro Sassone
    Inferring dynamic credentials for rôle-based trust management. [Citation Graph (0, 0)][DBLP]
    PPDP, 2006, pp:213-224 [Conf]
  50. Matthew Hennessy
    Powerdomains and nondeterministic recursive definitions. [Citation Graph (0, 0)][DBLP]
    Symposium on Programming, 1982, pp:178-193 [Conf]
  51. Matthew Hennessy
    Observing processes. [Citation Graph (0, 0)][DBLP]
    REX Workshop, 1988, pp:173-200 [Conf]
  52. Matthew Hennessy
    Modelling Fair Processes [Citation Graph (0, 0)][DBLP]
    STOC, 1984, pp:25-30 [Conf]
  53. Matthew Hennessy, Edward A. Ashcroft
    Parameter-Passing Mechanisms and Nondeterminism [Citation Graph (0, 0)][DBLP]
    STOC, 1977, pp:306-311 [Conf]
  54. S. Arun-Kumar, Matthew Hennessy
    An Efficiency Preorder for Processes. [Citation Graph (0, 0)][DBLP]
    TACS, 1991, pp:152-175 [Conf]
  55. Julian Rathke, Matthew Hennessy
    Local Model Checking for Value-Passing Processes (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    TACS, 1997, pp:250-266 [Conf]
  56. Rocco De Nicola, Matthew Hennessy
    CCS without tau's. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, Vol.1, 1987, pp:138-152 [Conf]
  57. S. Arun-Kumar, Matthew Hennessy
    An Efficiency Preorder for Processes. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1992, v:29, n:8, pp:737-760 [Journal]
  58. Matthew Hennessy
    Axiomatising Finite Delay Operators. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1984, v:21, n:, pp:61-88 [Journal]
  59. Matthew Hennessy
    Concurrent Testing of Processes [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1995, v:32, n:6, pp:509-543 [Journal]
  60. Matthew Hennessy, Xinxin Liu
    A Modal Logic for Message Passing Processes [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1995, v:32, n:4, pp:375-393 [Journal]
  61. Matthew Hennessy, Julian Rathke, Nobuko Yoshida
    safeDpi: a language for controlling mobile code. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2005, v:42, n:4-5, pp:227-290 [Journal]
  62. Daniele Gorla, Matthew Hennessy, Vladimiro Sassone
    Security Policies as Membranes in Systems for Global Computing. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:138, n:1, pp:23-42 [Journal]
  63. Matthew Hennessy
    A survey of location calculi. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1998, v:16, n:2, pp:- [Journal]
  64. Matthew Hennessy, Julian Rathke
    Typed behavioural equivalences for processes in the presence of subtyping. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:61, n:, pp:- [Journal]
  65. Matthew Hennessy, James Riely
    Resource Access Control in Systems of Mobile Agents. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1998, v:16, n:3, pp:- [Journal]
  66. Samuel Hym, Matthew Hennessy
    Adding Recursion to Dpi: (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:156, n:1, pp:115-133 [Journal]
  67. Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan, Chenyi Zhang
    Remarks on Testing Probabilistic Processes. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2007, v:172, n:, pp:359-397 [Journal]
  68. Rance Cleaveland, Matthew Hennessy
    Testing Equivalence as a Bisimulation Equivalence. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 1993, v:5, n:1, pp:1-20 [Journal]
  69. Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn
    A Theory of Processes with Localities. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 1994, v:6, n:2, pp:165-200 [Journal]
  70. Matthew Hennessy
    A Proof Sustem for Communicating Processes with Value-Passing. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 1991, v:3, n:4, pp:346-366 [Journal]
  71. Matthew Hennessy, Anna Ingólfsdóttir
    Communicating Processes with Value-passing and Assignments. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 1993, v:5, n:5, pp:432-466 [Journal]
  72. Matthew Hennessy, H. Lin
    Proof Systems for Message-Passing Process Algebras. [Citation Graph (0, 0)][DBLP]
    Formal Asp. Comput., 1996, v:8, n:4, pp:379-407 [Journal]
  73. Astrid Kiehn, Matthew Hennessy
    On the Decidability of Non-Interleaving Process Equivalences. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1997, v:30, n:1, pp:11-30 [Journal]
  74. Luca Aceto, Matthew Hennessy
    Towards Action-Refinement in Process Algebras [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:103, n:2, pp:204-269 [Journal]
  75. Luca Aceto, Matthew Hennessy
    Adding Action Refinement to a Finite Process Algebra [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:115, n:2, pp:179-247 [Journal]
  76. Rance Cleaveland, Matthew Hennessy
    Priorities in Process Algebras [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1990, v:87, n:1/2, pp:58-77 [Journal]
  77. Chrysafis Hartonas, Matthew Hennessy
    Full Abstractness for a Functional/Concurrent Language with Higher-Order Value-Passing. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1998, v:145, n:1, pp:64-106 [Journal]
  78. Matthew Hennessy
    A Term Model for Synchronous Processes [Citation Graph (0, 0)][DBLP]
    Information and Control, 1981, v:51, n:1, pp:58-75 [Journal]
  79. Matthew Hennessy
    Synchronous and Asynchronous Experiments on Processes [Citation Graph (0, 0)][DBLP]
    Information and Control, 1983, v:59, n:1-3, pp:36-83 [Journal]
  80. Matthew Hennessy
    A Fully Abstract Denotational Model for Higher-Order Processes [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:112, n:1, pp:55-95 [Journal]
  81. Matthew Hennessy, Anna Ingólfsdóttir
    A Theory of Communicating Processes with Value Passing [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1993, v:107, n:2, pp:202-236 [Journal]
  82. Matthew Hennessy, James Riely
    Resource Access Control in Systems of Mobile Agents. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:173, n:1, pp:82-120 [Journal]
  83. Matthew Hennessy, Tim Regan
    A Process Algebra for Timed Systems [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1995, v:117, n:2, pp:221-239 [Journal]
  84. Matthew Hennessy, Colin Stirling
    The Power of the Future Perfect in Program Logics [Citation Graph (0, 0)][DBLP]
    Information and Control, 1985, v:67, n:1-3, pp:23-52 [Journal]
  85. Nobuko Yoshida, Matthew Hennessy
    Assigning Types to Processes. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2002, v:174, n:2, pp:143-179 [Journal]
  86. Luca Aceto, Matthew Hennessy
    Termination, Deadlock, and Divergence. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1992, v:39, n:1, pp:147-187 [Journal]
  87. Ilaria Castellani, Matthew Hennessy
    Distributed bisimulations. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1989, v:36, n:4, pp:887-911 [Journal]
  88. Matthew Hennessy
    Acceptance Trees [Citation Graph (0, 0)][DBLP]
    J. ACM, 1985, v:32, n:4, pp:896-928 [Journal]
  89. Matthew Hennessy, Robin Milner
    Algebraic Laws for Nondeterminism and Concurrency [Citation Graph (0, 0)][DBLP]
    J. ACM, 1985, v:32, n:1, pp:137-161 [Journal]
  90. James Riely, Matthew Hennessy
    Trust and Partial Typing in Open Systems of Mobile Agents. [Citation Graph (0, 0)][DBLP]
    J. Autom. Reasoning, 2003, v:31, n:3-4, pp:335-370 [Journal]
  91. Matthew Hennessy
    A Proof System for the First-Order Relational Calculus. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1980, v:20, n:1, pp:96-110 [Journal]
  92. 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]
  93. Matthew Hennessy
    The security pi-calculus and non-interference. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2005, v:63, n:1, pp:3-34 [Journal]
  94. Daniele Gorla, Matthew Hennessy, Vladimiro Sassone
    Security Policies as Membranes in Systems for Global Computing. [Citation Graph (0, 0)][DBLP]
    Logical Methods in Computer Science, 2005, v:1, n:3, pp:- [Journal]
  95. Matthew Hennessy, Julian Rathke
    Typed behavioural equivalences for processes in the presence of subtyping. [Citation Graph (0, 0)][DBLP]
    Mathematical Structures in Computer Science, 2004, v:14, n:5, pp:651-684 [Journal]
  96. Matthew Hennessy, H. Lin, Julian Rathke
    Unique fixpoint induction for message-passing process calculi. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 2001, v:41, n:3, pp:241-275 [Journal]
  97. Matthew Hennessy
    The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:1, pp:67-84 [Journal]
  98. Matthew Hennessy
    Axiomatising Finite Concurrent Processes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1988, v:17, n:5, pp:997-1017 [Journal]
  99. Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn
    Observing Localities. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:114, n:1, pp:31-61 [Journal]
  100. Stephan Eidenbenz, Matthew Hennessy, Rafael Morales Bueno, Francisco Triguero Ruiz, Peter Widmayer, Ricardo Conejo
    Preface. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:312, n:1, pp:1-2 [Journal]
  101. William Ferreira, Matthew Hennessy
    A Behavioural Theory of First-Order CML. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:216, n:1-2, pp:55-107 [Journal]
  102. Matthew Hennessy
    A fully abstract denotational semantics for the pi-calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:278, n:1-2, pp:53-89 [Journal]
  103. Matthew Hennessy
    An Algebraic Theory of Fair Synchronous Communicating Processes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:49, n:, pp:121-143 [Journal]
  104. Matthew Hennessy, Edward A. Ashcroft
    A Mathematical Semantics for a Nondeterministic Typed lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:11, n:, pp:227-245 [Journal]
  105. Matthew Hennessy, H. Lin
    Symbolic Bisimulations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:138, n:2, pp:353-389 [Journal]
  106. Matthew Hennessy, Massimo Merro, Julian Rathke
    Towards a behavioural theory of access and mobility control in distributed systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:322, n:3, pp:615-669 [Journal]
  107. Matthew Hennessy, Julian Rathke
    Bisimulations for a Calculus of Broadcasting Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:200, n:1-2, pp:225-260 [Journal]
  108. Rocco De Nicola, Matthew Hennessy
    Testing Equivalences for Processes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1984, v:34, n:, pp:83-133 [Journal]
  109. James Riely, Matthew Hennessy
    Distributed processes and location failures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:266, n:1-2, pp:693-735 [Journal]
  110. Samuel Hym, Matthew Hennessy
    Adding recursion to Dpi. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:373, n:3, pp:182-212 [Journal]
  111. Matthew Hennessy
    Proving Systolic Systems Correct. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 1986, v:8, n:3, pp:344-387 [Journal]
  112. Matthew Hennessy, James Riely
    Information flow vs. resource access in the asynchronous pi-calculus. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2002, v:24, n:5, pp:566-591 [Journal]
  113. Massimo Merro, Matthew Hennessy
    A bisimulation-based semantic theory of Safe Ambients. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Program. Lang. Syst., 2006, v:28, n:2, pp:290-330 [Journal]
  114. Adrian Francalanza, Matthew Hennessy
    A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ESOP, 2007, pp:395-410 [Conf]
  115. Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan, Chenyi Zhang
    Characterising Testing Preorders for Finite Probabilistic Processes. [Citation Graph (0, 0)][DBLP]
    LICS, 2007, pp:313-325 [Conf]
  116. Adrian Francalanza, Matthew Hennessy
    A theory for observational fault tolerance. [Citation Graph (0, 0)][DBLP]
    J. Log. Algebr. Program., 2007, v:73, n:1-2, pp:22-50 [Journal]

  117. Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra. [Citation Graph (, )][DBLP]


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


  119. Testing Finitary Probabilistic Processes. [Citation Graph (, )][DBLP]


  120. Communicating Transactions - (Extended Abstract). [Citation Graph (, )][DBLP]


  121. Distributed Systems and Their Environments. [Citation Graph (, )][DBLP]


  122. Security Policies as Membranes in Systems for Global Computing [Citation Graph (, )][DBLP]


  123. Characterising Testing Preorders for Finite Probabilistic Processes [Citation Graph (, )][DBLP]


  124. Uniqueness Typing for Resource Management in Message-Passing Concurrency [Citation Graph (, )][DBLP]


  125. Preface. [Citation Graph (, )][DBLP]


  126. Counting the Cost in the Picalculus (Extended Abstract). [Citation Graph (, )][DBLP]


  127. Preface. [Citation Graph (, )][DBLP]


Search in 0.007secs, Finished in 0.010secs
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