Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Matthew Hennessy
2010 – today
- 2013
[j69]- [c73]Andrea Cerone, Matthew Hennessy, Massimo Merro: Modelling MAC-Layer Communications in Wireless Systems. COORDINATION 2013: 16-30
- 2012
- [j68]Vasileios Koutavas, Matthew Hennessy: First-order reasoning for higher-order concurrency. Computer Languages, Systems & Structures 38(3): 242-277 (2012)
- [j67]Matthew Hennessy: Exploring probabilistic bisimulations, part I. Formal Asp. Comput. 24(4-6): 749-768 (2012)
- [c72]Andrea Cerone, Matthew Hennessy: Modelling Probabilistic Wireless Networks - (Extended Abstract). FMOODS/FORTE 2012: 135-151
- [c71]
- 2011
- [j66]Matthew Hennessy: A calculus for costed computations. Logical Methods in Computer Science 7(1) (2011)
- [c70]Vasileios Koutavas, Matthew Hennessy: A Testing Theory for a Higher-Order Cryptographic Language - (Extended Abstract). ESOP 2011: 358-377
- [c69]Yuxin Deng, Matthew Hennessy: Compositional Reasoning for Markov Decision Processes - (Extended Abstract). FSEN 2011: 143-157
- [c68]
- [c67]Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan: Real-Reward Testing for Probabilistic Processes (Extended Abstract). QAPL 2011: 61-73
- 2010
- [c66]Edsko de Vries, Vasileios Koutavas, Matthew Hennessy: Liveness of Communicating Transactions (Extended Abstract). APLAS 2010: 392-407
- [c65]Edsko de Vries, Vasileios Koutavas, Matthew Hennessy: Communicating Transactions - (Extended Abstract). CONCUR 2010: 569-583
- [c64]Andrea Cerone, Matthew Hennessy: Process Behaviour: Formulae vs. Tests (Extended Abstract). EXPRESS'10 2010: 31-45
2000 – 2009
- 2009
- [j65]Matthew Hennessy, Manish Gaur: Counting the Cost in the Picalculus (Extended Abstract). Electr. Notes Theor. Comput. Sci. 229(3): 117-129 (2009)
- [j64]
- [c63]Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan: Testing Finitary Probabilistic Processes. CONCUR 2009: 274-288
- [c62]
- [c61]Edsko de Vries, Adrian Francalanza, Matthew Hennessy: Uniqueness Typing for Resource Management in Message-Passing Concurrency. LINEARITY 2009: 26-37
- 2008
- [j63]Adrian Francalanza, Matthew Hennessy: A theory of system behaviour in the presence of node and link failure. Inf. Comput. 206(6): 711-759 (2008)
- [j62]Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan: Characterising Testing Preorders for Finite Probabilistic Processes. Logical Methods in Computer Science 4(4) (2008)
- [c60]Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Mogens Nielsen, Glynn Winskel: Twenty Years on: Reflections on the CEDISYS Project. Combining True Concurrency with Process Algebra. Concurrency, Graphs and Models 2008: 757-777
- [i2]Yuxin Deng, Matthew Hennessy, Rob J. van Glabbeek, Carroll Morgan: Characterising Testing Preorders for Finite Probabilistic Processes. CoRR abs/0810.3708 (2008)
- 2007
- [b3]Matthew Hennessy: A distributed Pi-calculus. Cambridge University Press 2007, pp. I-XVI, 1-259
- [j61]Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan, Chenyi Zhang: Remarks on Testing Probabilistic Processes. Electr. Notes Theor. Comput. Sci. 172: 359-397 (2007)
- [j60]Rob J. van Glabbeek, Matthew Hennessy: Preface. Electr. Notes Theor. Comput. Sci. 192(1): 1-3 (2007)
- [j59]Adrian Francalanza, Matthew Hennessy: A theory for observational fault tolerance. J. Log. Algebr. Program. 73(1-2): 22-50 (2007)
- [j58]
- [c59]Adrian Francalanza, Matthew Hennessy: A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract). ESOP 2007: 395-410
- [c58]Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan, Chenyi Zhang: Characterising Testing Preorders for Finite Probabilistic Processes. LICS 2007: 313-325
- 2006
- [j57]Samuel Hym, Matthew Hennessy: Adding Recursion to Dpi: (Extended Abstract). Electr. Notes Theor. Comput. Sci. 156(1): 115-133 (2006)
- [j56]Massimo Merro, Matthew Hennessy: A bisimulation-based semantic theory of Safe Ambients. ACM Trans. Program. Lang. Syst. 28(2): 290-330 (2006)
- [c57]Adrian Francalanza, Matthew Hennessy: A Theory for Observational Fault Tolerance. FoSSaCS 2006: 16-31
- [c56]Daniele Gorla, Matthew Hennessy, Vladimiro Sassone: Inferring dynamic credentials for rôle-based trust management. PPDP 2006: 213-224
- 2005
- [j55]Matthew Hennessy, Julian Rathke, Nobuko Yoshida: safeDpi: a language for controlling mobile code. Acta Inf. 42(4-5): 227-290 (2005)
- [j54]Daniele Gorla, Matthew Hennessy, Vladimiro Sassone: Security Policies as Membranes in Systems for Global Computing. Electr. Notes Theor. Comput. Sci. 138(1): 23-42 (2005)
- [j53]Matthew Hennessy: The security pi-calculus and non-interference. J. Log. Algebr. Program. 63(1): 3-34 (2005)
- [j52]Daniele Gorla, Matthew Hennessy, Vladimiro Sassone: Security Policies as Membranes in Systems for Global Computing. Logical Methods in Computer Science 1(3) (2005)
- [c55]Adrian Francalanza, Matthew Hennessy: A Theory of System Behaviour in the Presence of Node and Link Failures. CONCUR 2005: 368-382
- [c54]Alberto Ciaffaglione, Matthew Hennessy, Julian Rathke: Proof Methodologies for Behavioural Equivalence in DPI. FORTE 2005: 335-350
- [i1]Daniele Gorla, Matthew Hennessy, Vladimiro Sassone: Security Policies as Membranes in Systems for Global Computing. CoRR abs/cs/0506061 (2005)
- 2004
- [j51]Matthew Hennessy, Julian Rathke: Typed behavioural equivalences for processes in the presence of subtyping. Mathematical Structures in Computer Science 14(5): 651-684 (2004)
- [j50]Stephan Eidenbenz, Matthew Hennessy, Rafael Morales Bueno, Francisco Triguero Ruiz, Peter Widmayer, Ricardo Conejo: Preface. Theor. Comput. Sci. 312(1): 1-2 (2004)
- [j49]Matthew Hennessy, Massimo Merro, Julian Rathke: Towards a behavioural theory of access and mobility control in distributed systems. Theor. Comput. Sci. 322(3): 615-669 (2004)
- [c53]Matthew Hennessy, Julian Rathke, Nobuko Yoshida: safeDpi: A Language for Controlling Mobile Code. FoSSaCS 2004: 241-256
- 2003
- [j48]James Riely, Matthew Hennessy: Trust and Partial Typing in Open Systems of Mobile Agents. J. Autom. Reasoning 31(3-4): 335-370 (2003)
- [c52]Matthew Hennessy, Massimo Merro, Julian Rathke: Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems. FoSSaCS 2003: 282-298
- 2002
- [j47]Matthew Hennessy, Julian Rathke: Typed behavioural equivalences for processes in the presence of subtyping. Electr. Notes Theor. Comput. Sci. 61: 122-139 (2002)
- [j46]Matthew Hennessy, James Riely: Resource Access Control in Systems of Mobile Agents. Inf. Comput. 173(1): 82-120 (2002)
- [j45]
- [j44]Matthew Hennessy: A fully abstract denotational semantics for the pi-calculus. Theor. Comput. Sci. 278(1-2): 53-89 (2002)
- [j43]Matthew Hennessy, James Riely: Information flow vs. resource access in the asynchronous pi-calculus. ACM Trans. Program. Lang. Syst. 24(5): 566-591 (2002)
- [c51]
- [e1]Peter Widmayer, Francisco Triguero Ruiz, Rafael Morales Bueno, Matthew Hennessy, Stephan Eidenbenz, Ricardo Conejo (Eds.): Automata, Languages and Programming, 29th International Colloquium, ICALP 2002, Malaga, Spain, July 8-13, 2002, Proceedings. Lecture Notes in Computer Science 2380, Springer 2002, ISBN 3-540-43864-5
- 2001
- [j42]Matthew Hennessy, Huimin Lin, Julian Rathke: Unique fixpoint induction for message-passing process calculi. Sci. Comput. Program. 41(3): 241-275 (2001)
- [j41]James Riely, Matthew Hennessy: Distributed processes and location failures. Theor. Comput. Sci. 266(1-2): 693-735 (2001)
- 2000
- [c50]William Ferreira, Matthew Hennessy, Alan Jeffrey: Combining the typed lambda-calculus with CCS. Proof, Language, and Interaction 2000: 511-534
- [c49]Matthew Hennessy, James Riely: Information Flow vs. Resource Access in the Asynchronous Pi-Calculus. ICALP 2000: 415-427
- [c48]
1990 – 1999
- 1999
- [j40]William Ferreira, Matthew Hennessy: A Behavioural Theory of First-Order CML. Theor. Comput. Sci. 216(1-2): 55-107 (1999)
- [c47]Nobuko Yoshida, Matthew Hennessy: Suptyping and Locality in Distributed Higher Order Processes (extended abstract). CONCUR 1999: 557-572
- [c46]Matthew Hennessy, James Riely: Type-Safe Execution of Mobile Agents in Anonymous Networks. Secure Internet Programming 1999: 95-115
- [c45]
- [c44]
- [c43]James Riely, Matthew Hennessy: Trust and Partial Typing in Open Systems of Mobile Agents. POPL 1999: 93-104
- 1998
- [j39]
- [j38]Matthew Hennessy, James Riely: Resource Access Control in Systems of Mobile Agents. Electr. Notes Theor. Comput. Sci. 16(3): 174-188 (1998)
- [j37]Chrysafis Hartonas, Matthew Hennessy: Full Abstractness for a Functional/Concurrent Language with Higher-Order Value-Passing. Inf. Comput. 145(1): 64-106 (1998)
- [j36]Pierre-Louis Curien, Matthew Hennessy, Huimin Lin: Preface. J. Comput. Sci. Technol. 13(6): 481 (1998)
- [j35]Matthew Hennessy: Process Calculi for describing distributed systems. J. Comput. Sci. Technol. 13(6): 490 (1998)
- [j34]William Ferreira, Matthew Hennessy, Alan Jeffrey: A Theory of Weak Bisimulation for Core CML. J. Funct. Program. 8(5): 447-491 (1998)
- [j33]Matthew Hennessy, Julian Rathke: Bisimulations for a Calculus of Broadcasting Systems. Theor. Comput. Sci. 200(1-2): 225-260 (1998)
- [c42]Matthew Hennessy, James Riely: Type-Safe Execution of Mobile Agents in Anonymous Networks. ECOOP Workshops 1998: 304
- [c41]Ilaria Castellani, Matthew Hennessy: Testing Theories for Asynchronous Languages. FSTTCS 1998: 90-101
- [c40]James Riely, Matthew Hennessy: A Typed Language for Distributed Mobile Processes (Extended Abstract). POPL 1998: 378-390
- 1997
- [j32]Astrid Kiehn, Matthew Hennessy: On the Decidability of Non-Interleaving Process Equivalences. Fundam. Inform. 30(1): 11-30 (1997)
- [c39]Chrysafis Hartonas, Matthew Hennessy: Full Abstractness for a Functional/Concurrent Language with Higher-Order Value-Passing (Extended Abstract). CSL 1997: 239-254
- [c38]James Riely, Matthew Hennessy: Distributed Processes and Location Failures (Extended Abstract). ICALP 1997: 471-481
- [c37]Julian Rathke, Matthew Hennessy: Local Model Checking for Value-Passing Processes (Extended Abstract). TACS 1997: 250-266
- 1996
- [j31]Matthew Hennessy, Huimin Lin: Proof Systems for Message-Passing Process Algebras. Formal Asp. Comput. 8(4): 379-407 (1996)
- [c36]William Ferreira, Matthew Hennessy, Alan Jeffrey: A Theory of Weak Bisimulation for Core CML. ICFP 1996: 201-212
- 1995
- [j30]Matthew Hennessy, Xinxin Liu: A Modal Logic for Message Passing Processes. Acta Inf. 32(4): 375-393 (1995)
- [j29]
- [j28]Matthew Hennessy, Tim Regan: A Process Algebra for Timed Systems. Inf. Comput. 117(2): 221-239 (1995)
- [j27]
- [c35]Matthew Hennessy, Julian Rathke: Bisimulations for a Calculus of Broadcasting Systems. CONCUR 1995: 486-500
- [c34]William Ferreira, Matthew Hennessy: Towards a Semantic Theory of CML (Extended Abstract). MFCS 1995: 454-466
- 1994
- [j26]Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn: A Theory of Processes with Localities. Formal Asp. Comput. 6(2): 165-200 (1994)
- [j25]Matthew Hennessy: A Fully Abstract Denotational Model for Higher-Order Processes. Inf. Comput. 112(1): 55-95 (1994)
- [j24]Luca Aceto, Matthew Hennessy: Adding Action Refinement to a Finite Process Algebra. Inf. Comput. 115(2): 179-247 (1994)
- [c33]
- 1993
- [j23]Rance Cleaveland, Matthew Hennessy: Testing Equivalence as a Bisimulation Equivalence. Formal Asp. Comput. 5(1): 1-20 (1993)
- [j22]Matthew Hennessy, Anna Ingólfsdóttir: Communicating Processes with Value-passing and Assignments. Formal Asp. Comput. 5(5): 432-466 (1993)
- [j21]Luca Aceto, Matthew Hennessy: Towards Action-Refinement in Process Algebras. Inf. Comput. 103(2): 204-269 (1993)
- [j20]Matthew Hennessy, Anna Ingólfsdóttir: A Theory of Communicating Processes with Value Passing. Inf. Comput. 107(2): 202-236 (1993)
- [j19]Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn: Observing Localities. Theor. Comput. Sci. 114(1): 31-61 (1993)
- [c32]Matthew Hennessy, Xinxin Liu: A Modal Logic for Message passing Processes (Extended Abstract). CAV 1993: 359-370
- [c31]Matthew Hennessy, Huimin Lin: Proof Systems for Message-Passing Process Algebras. CONCUR 1993: 202-216
- [c30]Matthew Hennessy: A Fully Abstract Denotational Model for Higher-Order Processes (Extended Abstract). LICS 1993: 397-408
- [c29]
- 1992
- [j18]S. Arun-Kumar, Matthew Hennessy: An Efficiency Preorder for Processes. Acta Inf. 29(8): 737-760 (1992)
- [j17]
- [c28]
- [c27]Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn: A Theory of Process with Localities (Extended Abstract). CONCUR 1992: 108-122
- 1991
- [j16]Matthew Hennessy: A Proof Sustem for Communicating Processes with Value-Passing. Formal Asp. Comput. 3(4): 346-366 (1991)
- [c26]Luca Aceto, Matthew Hennessy: Adding Action Refinement to a Finite Process Algebra. ICALP 1991: 506-519
- [c25]Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn: Observing Localities (Extended Abstract). MFCS 1991: 93-102
- [c24]
- 1990
- [b2]Matthew Hennessy: Semantics of programming languages - an elementary introduction using structural operational semantics. Wiley 1990, ISBN 978-0-471-92772-3, pp. I-XII, 1-157
- [j15]Rance Cleaveland, Matthew Hennessy: Priorities in Process Algebras. Inf. Comput. 87(1/2): 58-77 (1990)
- [c23]
- [c22]
- [c21]Matthew Hennessy, Anna Ingólfsdóttir: A Theory of Communicating Processes with Value-Passing. ICALP 1990: 209-219
1980 – 1989
- 1989
- [j14]
- [c20]Rance Cleaveland, Matthew Hennessy: Testing Equivalence as a Bisimulation Equivalence. Automatic Verification Methods for Finite State Systems 1989: 11-23
- [c19]Matthew Hennessy: A Proof System for Communicating Processes with Value-passing (Extended Abstract). FSTTCS 1989: 325-339
- [c18]
- [c17]Luca Aceto, Matthew Hennessy: Termination, Deadlock and Divergence. Mathematical Foundations of Programming Semantics 1989: 301-318
- 1988
- [b1]Matthew Hennessy: Algebraic theory of processes. MIT Press series in the foundations of computing, MIT Press 1988, ISBN 978-0-262-08171-9, pp. I-VI, 1-270
- [j13]
- [c16]
- [c15]
- 1987
- [j12]Matthew Hennessy: An Algebraic Theory of Fair Synchronous Communicating Processes. Theor. Comput. Sci. 49: 121-143 (1987)
- [c14]
- 1986
- [j11]Matthew Hennessy: Proving Systolic Systems Correct. ACM Trans. Program. Lang. Syst. 8(3): 344-387 (1986)
- [c13]Matthew Hennessy: Communication Primitives in Programming and Specification Languages. Networking in Open Systems 1986: 223-251
- 1985
- [j10]Matthew Hennessy, Colin Stirling: The Power of the Future Perfect in Program Logics. Information and Control 67(1-3): 23-52 (1985)
- [j9]Matthew Hennessy, Robin Milner: Algebraic Laws for Nondeterminism and Concurrency. J. ACM 32(1): 137-161 (1985)
- [j8]
- [c12]Matthew Hennessy: An Algebraic Theory of Fair Asynchronous Communicating Processes. ICALP 1985: 260-269
- 1984
- [j7]
- [j6]Rocco De Nicola, Matthew Hennessy: Testing Equivalences for Processes. Theor. Comput. Sci. 34: 83-133 (1984)
- [c11]Matthew Hennessy, Colin Stirling: The Power of the Future Perfect in Program Logics. MFCS 1984: 301-311
- [c10]
- 1983
- [j5]Matthew Hennessy: Synchronous and Asynchronous Experiments on Processes. Information and Control 59(1-3): 36-83 (1983)
- [c9]
- [c8]Matthew Hennessy: Synchronous and Asynchronous Experiments on Processes. IFIP Congress 1983: 453-455
- 1982
- [c7]Matthew Hennessy: Powerdomains and nondeterministic recursive definitions. Symposium on Programming 1982: 178-193
- 1981
- [j4]Matthew Hennessy: A Term Model for Synchronous Processes. Information and Control 51(1): 58-75 (1981)
- [c6]Matthew Hennessy, W. Li, Gordon D. Plotkin: A First Attempt at Translating CSP into CCS. ICDCS 1981: 105-115
- 1980
- [j3]Matthew Hennessy: A Proof System for the First-Order Relational Calculus. J. Comput. Syst. Sci. 20(1): 96-110 (1980)
- [j2]Matthew Hennessy: The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment. SIAM J. Comput. 9(1): 67-84 (1980)
- [j1]Matthew Hennessy, Edward A. Ashcroft: A Mathematical Semantics for a Nondeterministic Typed lambda-Calculus. Theor. Comput. Sci. 11: 227-245 (1980)
- [c5]
- [c4]
1970 – 1979
- 1979
- [c3]Matthew Hennessy, Gordon D. Plotkin: Full Abstraction for a Simple Parallel Programming Language. MFCS 1979: 108-120
- 1977
- [c2]Matthew Hennessy, Edward A. Ashcroft: Parameter-Passing Mechanisms and Nondeterminism. STOC 1977: 306-311
- 1976
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-23 22:15 CEST by the dblp team