default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatthew Hennessy
Person information
- affiliation: Trinity College Dublin, Ireland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2010 – 2019
- 2019
[c93]Matthew Hennessy:
An Equational Characterisation of the Must Testing Pre-order for Regular Processes. Models, Languages, and Tools for Concurrent and Distributed Programming 2019: 15-27- 2018
- [j70]Vasileios Koutavas, Maciej Gazda, Matthew Hennessy:
Distinguishing between communicating transactions. Inf. Comput. 259(1): 1-30 (2018) - 2017
- [c92]Matthew Hennessy:
A Coinductive Equational Characterisation of Trace Inclusion for Regular Processes. Models, Algorithms, Logics and Tools 2017: 449-465 - [i3]Vasileios Koutavas, Maciej Gazda, Matthew Hennessy:
Distinguishing between Communicating Transactions. CoRR abs/1703.03256 (2017) - 2016
- [j69]Giovanni Bernardi, Matthew Hennessy:
Using higher-order contracts to model session types. Log. Methods Comput. Sci. 12(2) (2016) - [j68]Giovanni Tito Bernardi, Matthew Hennessy:
Modelling session types using contracts. Math. Struct. Comput. Sci. 26(3): 510-560 (2016) - 2015
- [j67]Andrea Cerone
, Matthew Hennessy, Massimo Merro:
Modelling MAC-Layer Communications in Wireless Systems. Log. Methods Comput. Sci. 11(1) (2015) - [j66]Giovanni Bernardi, Matthew Hennessy:
Mutually Testing Processes. Log. Methods Comput. Sci. 11(2) (2015) - [c91]Matthew Hennessy:
Behavioural Equivalences for Co-operating Transactions (Invited Paper). CONCUR 2015: 41-41 - 2014
- [j65]Adrian Francalanza, Edsko de Vries, Matthew Hennessy:
Compositional Reasoning for Explicit Resource Management in Channel-Based Concurrency. Log. Methods Comput. Sci. 10(2) (2014) - [j64]Edsko de Vries, Adrian Francalanza, Matthew Hennessy:
Uniqueness typing for resource management in message-passing concurrency. J. Log. Comput. 24(3): 531-556 (2014) - [j63]Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan:
Real-reward testing for probabilistic processes. Theor. Comput. Sci. 538: 16-36 (2014) - [c90]Giovanni Bernardi, Matthew Hennessy:
Using Higher-Order Contracts to Model Session Types (Extended Abstract). CONCUR 2014: 387-401 - [c89]Vasileios Koutavas, Carlo Spaccasassi, Matthew Hennessy:
Bisimulations for Communicating Transactions - (Extended Abstract). FoSSaCS 2014: 320-334 - [c88]Andrea Cerone, Matthew Hennessy:
Characterising Testing Preorders for Broadcasting Distributed Systems. TGC 2014: 67-81 - 2013
- [j62]Andrea Cerone, Matthew Hennessy:
Modelling Probabilistic Wireless Networks. Log. Methods Comput. Sci. 9(3) (2013) - [j61]Yuxin Deng, Matthew Hennessy:
On the semantics of Markov automata. Inf. Comput. 222: 139-168 (2013) - [j60]Yuxin Deng, Matthew Hennessy:
Compositional reasoning for weighted Markov decision processes. Sci. Comput. Program. 78(12): 2537-2579 (2013) - [c87]Giovanni Bernardi, Matthew Hennessy:
Mutually Testing Processes - (Extended Abstract). CONCUR 2013: 61-75 - [c86]Vasileios Koutavas, Matthew Hennessy:
Symbolic Bisimulation for a Higher-Order Distributed Language with Passivation - (Extended Abstract). CONCUR 2013: 167-181 - [c85]Andrea Cerone, Matthew Hennessy, Massimo Merro:
Modelling MAC-Layer Communications in Wireless Systems. COORDINATION 2013: 16-30 - [c84]Giovanni Bernardi, Matthew Hennessy:
Compliance and Testing Preorders Differ. SEFM Workshops 2013: 69-81 - 2012
- [j59]Vasileios Koutavas, Matthew Hennessy:
First-order reasoning for higher-order concurrency. Comput. Lang. Syst. Struct. 38(3): 242-277 (2012) - [j58]Matthew Hennessy:
Exploring probabilistic bisimulations, part I. Formal Aspects Comput. 24(4-6): 749-768 (2012) - [c83]Andrea Cerone, Matthew Hennessy:
Modelling Probabilistic Wireless Networks - (Extended Abstract). FMOODS/FORTE 2012: 135-151 - [c82]Giovanni Bernardi, Matthew Hennessy:
Modelling session types using contracts. SAC 2012: 1941-1946 - 2011
- [j57]Matthew Hennessy:
A calculus for costed computations. Log. Methods Comput. Sci. 7(1) (2011) - [c81]Vasileios Koutavas, Matthew Hennessy:
A Testing Theory for a Higher-Order Cryptographic Language - (Extended Abstract). ESOP 2011: 358-377 - [c80]Yuxin Deng, Matthew Hennessy:
Compositional Reasoning for Markov Decision Processes - (Extended Abstract). FSEN 2011: 143-157 - [c79]Yuxin Deng, Matthew Hennessy:
On the Semantics of Markov Automata. ICALP (2) 2011: 307-318 - [c78]Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan:
Real-Reward Testing for Probabilistic Processes (Extended Abstract). QAPL 2011: 61-73 - 2010
- [c77]Edsko de Vries, Vasileios Koutavas, Matthew Hennessy:
Liveness of Communicating Transactions (Extended Abstract). APLAS 2010: 392-407 - [c76]Edsko de Vries, Vasileios Koutavas, Matthew Hennessy:
Communicating Transactions - (Extended Abstract). CONCUR 2010: 569-583 - [c75]Andrea Cerone, Matthew Hennessy:
Process Behaviour: Formulae vs. Tests (Extended Abstract). EXPRESS 2010: 31-45
2000 – 2009
- 2009
- [c74]Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan:
Testing Finitary Probabilistic Processes. CONCUR 2009: 274-288 - [c73]Matthew Hennessy:
Distributed Systems and Their Environments. TAMC 2009: 4-5 - [c72]Edsko de Vries, Adrian Francalanza, Matthew Hennessy:
Uniqueness Typing for Resource Management in Message-Passing Concurrency. LINEARITY 2009: 26-37 - [e3]Matthew Hennessy, Bartek Klin:
Proceedings of the Fifth Workshop on Structural Operational Semantics, SOS@ICALP 2008, Reykjavik, Iceland, July 6, 2008. Electronic Notes in Theoretical Computer Science 229(4), Elsevier 2009 [contents] - 2008
- [j56]Adrian Francalanza, Matthew Hennessy:
A theory of system behaviour in the presence of node and link failure. Inf. Comput. 206(6): 711-759 (2008) - [j55]Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan:
Characterising Testing Preorders for Finite Probabilistic Processes. Log. Methods Comput. Sci. 4(4) (2008) - [c71]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 - [c70]Matthew Hennessy, Bartek Klin:
Preface. SOS@ICALP 2008: 1-2 - [c69]Matthew Hennessy, Manish Gaur:
Counting the Cost in the Picalculus (Extended Abstract). ICE@ICALP 2008: 117-129 - [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 - [j54]Adrian Francalanza, Matthew Hennessy:
A theory for observational fault tolerance. J. Log. Algebraic Methods Program. 73(1-2): 22-50 (2007) - [j53]Samuel Hym, Matthew Hennessy:
Adding recursion to Dpi. Theor. Comput. Sci. 373(3): 182-212 (2007) - [c68]Adrian Francalanza, Matthew Hennessy:
A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract). ESOP 2007: 395-410 - [c67]Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan, Chenyi Zhang:
Characterising Testing Preorders for Finite Probabilistic Processes. LICS 2007: 313-325 - [c66]Rob J. van Glabbeek, Matthew Hennessy:
Preface. SOS@LICS/ICALP 2007: 1-3 - [c65]Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan, Chenyi Zhang:
Remarks on Testing Probabilistic Processes. Computation, Meaning, and Logic 2007: 359-397 - [e2]Rob van Glabbeek, Matthew Hennessy:
Proceedings of the Fourth Workshop on Structural Operational Semantics, SOS@LICS/ICALP 2007, Wroclaw, Poland, July 9, 2007. Electronic Notes in Theoretical Computer Science 192(1), Elsevier 2007 [contents] - 2006
- [j52]Massimo Merro, Matthew Hennessy:
A bisimulation-based semantic theory of Safe Ambients. ACM Trans. Program. Lang. Syst. 28(2): 290-330 (2006) - [c64]Adrian Francalanza, Matthew Hennessy:
A Theory for Observational Fault Tolerance. FoSSaCS 2006: 16-31 - [c63]Daniele Gorla, Matthew Hennessy, Vladimiro Sassone:
Inferring dynamic credentials for rôle-based trust management. PPDP 2006: 213-224 - 2005
- [j51]Matthew Hennessy, Julian Rathke, Nobuko Yoshida:
safeDpi: a language for controlling mobile code. Acta Informatica 42(4-5): 227-290 (2005) - [j50]Matthew Hennessy:
The security pi-calculus and non-interference. J. Log. Algebraic Methods Program. 63(1): 3-34 (2005) - [j49]Daniele Gorla, Matthew Hennessy, Vladimiro Sassone:
Security Policies as Membranes in Systems for Global Computing. Log. Methods Comput. Sci. 1(3) (2005) - [c62]Adrian Francalanza, Matthew Hennessy:
A Theory of System Behaviour in the Presence of Node and Link Failures. CONCUR 2005: 368-382 - [c61]Alberto Ciaffaglione, Matthew Hennessy, Julian Rathke:
Proof Methodologies for Behavioural Equivalence in DPI. FORTE 2005: 335-350 - [c60]Samuel Hym, Matthew Hennessy:
Adding Recursion to Dpi: (Extended Abstract). SOS@ICALP 2005: 115-133 - [i1]Daniele Gorla, Matthew Hennessy, Vladimiro Sassone:
Security Policies as Membranes in Systems for Global Computing. CoRR abs/cs/0506061 (2005) - 2004
- [j48]Matthew Hennessy, Julian Rathke:
Typed behavioural equivalences for processes in the presence of subtyping. Math. Struct. Comput. Sci. 14(5): 651-684 (2004) - [j47]Stephan J. Eidenbenz, Matthew Hennessy, Rafael Morales Bueno, Francisco Triguero Ruiz, Peter Widmayer, Ricardo Conejo:
Preface. Theor. Comput. Sci. 312(1): 1-2 (2004) - [j46]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) - [c59]Matthew Hennessy, Julian Rathke, Nobuko Yoshida:
safeDpi: A Language for Controlling Mobile Code. FoSSaCS 2004: 241-256 - [c58]Daniele Gorla, Matthew Hennessy, Vladimiro Sassone:
Security Policies as Membranes in Systems for Global Computing. FGUC 2004: 23-42 - 2003
- [j45]James Riely, Matthew Hennessy:
Trust and Partial Typing in Open Systems of Mobile Agents. J. Autom. Reason. 31(3-4): 335-370 (2003) - [c57]Matthew Hennessy, Massimo Merro, Julian Rathke:
Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems. FoSSaCS 2003: 282-298 - [c56]Matthew Hennessy:
The Security Picalculus and Non-interference (Extended Abstract). MFPS 2003: 113-129 - 2002
- [j44]Matthew Hennessy, James Riely:
Resource Access Control in Systems of Mobile Agents. Inf. Comput. 173(1): 82-120 (2002) - [j43]Nobuko Yoshida, Matthew Hennessy:
Assigning Types to Processes. Inf. Comput. 174(2): 143-179 (2002) - [j42]Matthew Hennessy:
A fully abstract denotational semantics for the pi-calculus. Theor. Comput. Sci. 278(1-2): 53-89 (2002) - [j41]Matthew Hennessy, James Riely:
Information flow vs. resource access in the asynchronous pi-calculus. ACM Trans. Program. Lang. Syst. 24(5): 566-591 (2002) - [c55]Massimo Merro, Matthew Hennessy:
Bisimulation congruences in safe ambients. POPL 2002: 71-80 - [c54]Matthew Hennessy, Julian Rathke:
Typed behavioural equivalences for processes in the presence of subtyping. CATS 2002: 122-139 - [e1]Peter Widmayer, Francisco Triguero Ruiz, Rafael Morales Bueno, Matthew Hennessy, Stephan J. Eidenbenz, Ricardo Conejo:
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 [contents] - 2001
- [j40]Matthew Hennessy, Huimin Lin, Julian Rathke:
Unique fixpoint induction for message-passing process calculi. Sci. Comput. Program. 41(3): 241-275 (2001) - [j39]James Riely, Matthew Hennessy:
Distributed processes and location failures. Theor. Comput. Sci. 266(1-2): 693-735 (2001) - 2000
- [c53]William Ferreira, Matthew Hennessy, Alan Jeffrey:
Combining the typed lambda-calculus with CCS. Proof, Language, and Interaction 2000: 511-534 - [c52]Matthew Hennessy, James Riely:
Information Flow vs. Resource Access in the Asynchronous Pi-Calculus. ICALP 2000: 415-427 - [c51]Nobuko Yoshida, Matthew Hennessy:
Assigning Types to Processes. LICS 2000: 334-345
1990 – 1999
- 1999
- [j38]William Ferreira, Matthew Hennessy:
A Behavioural Theory of First-Order CML. Theor. Comput. Sci. 216(1-2): 55-107 (1999) - [c50]Nobuko Yoshida, Matthew Hennessy:
Suptyping and Locality in Distributed Higher Order Processes (extended abstract). CONCUR 1999: 557-572 - [c49]Matthew Hennessy, James Riely:
Type-Safe Execution of Mobile Agents in Anonymous Networks. Secure Internet Programming 1999: 95-115 - [c48]Matthew Hennessy:
Axiomatising Asynchronous Process Calculi (abstract). FCT 1999: 90 - [c47]Matthew Hennessy:
Proof Systems for Message-Passing Process Calculi. IFM 1999: 26 - [c46]James Riely, Matthew Hennessy:
Trust and Partial Typing in Open Systems of Mobile Agents. POPL 1999: 93-104 - 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) - [c45]Matthew Hennessy, James Riely:
Type-Safe Execution of Mobile Agents in Anonymous Networks. ECOOP Workshops 1998: 304 - [c44]Ilaria Castellani, Matthew Hennessy:
Testing Theories for Asynchronous Languages. FSTTCS 1998: 90-101 - [c43]James Riely, Matthew Hennessy:
A Typed Language for Distributed Mobile Processes (Extended Abstract). POPL 1998: 378-390 - [c42]Matthew Hennessy:
A survey of location calculi. EXPRESS 1998: 97 - [c41]Matthew Hennessy, James Riely:
Resource Access Control in Systems of Mobile Agents. HLCL 1998: 174-188 - 1997
- [j32]Astrid Kiehn, Matthew Hennessy:
On the Decidability of Non-Interleaving Process Equivalences. Fundam. Informaticae 30(1): 11-30 (1997) - [c40]Chrysafis Hartonas, Matthew Hennessy:
Full Abstractness for a Functional/Concurrent Language with Higher-Order Value-Passing (Extended Abstract). CSL 1997: 239-254 - [c39]James Riely, Matthew Hennessy:
Distributed Processes and Location Failures (Extended Abstract). ICALP 1997: 471-481 - [c38]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 Aspects Comput. 8(4): 379-407 (1996) - [c37]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 Informatica 32(4): 375-393 (1995) - [j29]Matthew Hennessy:
Concurrent Testing of Processes. Acta Informatica 32(6): 509-543 (1995) - [j28]Matthew Hennessy, Tim Regan:
A Process Algebra for Timed Systems. Inf. Comput. 117(2): 221-239 (1995) - [j27]Matthew Hennessy, Huimin Lin:
Symbolic Bisimulations. Theor. Comput. Sci. 138(2): 353-389 (1995) - [c36]Matthew Hennessy, Julian Rathke:
Bisimulations for a Calculus of Broadcasting Systems. CONCUR 1995: 486-500 - [c35]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 Aspects 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) - [c34]Matthew Hennessy:
Higher-Order Process and Their Models. ICALP 1994: 286-303 - 1993
- [j23]Rance Cleaveland, Matthew Hennessy:
Testing Equivalence as a Bisimulation Equivalence. Formal Aspects Comput. 5(1): 1-20 (1993) - [j22]Matthew Hennessy, Anna Ingólfsdóttir:
Communicating Processes with Value-passing and Assignments. Formal Aspects 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) - [c33]Matthew Hennessy, Xinxin Liu:
A Modal Logic for Message passing Processes (Extended Abstract). CAV 1993: 359-370 - [c32]Matthew Hennessy, Huimin Lin:
Proof Systems for Message-Passing Process Algebras. CONCUR 1993: 202-216 - [c31]Matthew Hennessy:
A Fully Abstract Denotational Model for Higher-Order Processes (Extended Abstract). LICS 1993: 397-408 - [c30]Matthew Hennessy:
Symbolic Bisimulations (Abstract). MFCS 1993: 83 - 1992
- [j18]S. Arun-Kumar, Matthew Hennessy:
An Efficiency Preorder for Processes. Acta Informatica 29(8): 737-760 (1992) - [j17]Luca Aceto, Matthew Hennessy:
Termination, Deadlock, and Divergence. J. ACM 39(1): 147-187 (1992) - [c29]Matthew Hennessy:
Concurrent Testing of Processes (Extended Abstract). CONCUR 1992: 94-107 - [c28]Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn:
A Theory of Process with Localities (Extended Abstract). CONCUR 1992: 108-122 - [c27]Matthew Hennessy:
Timed Process Algebras: A Tutorial. NATO ASI PDC 1992: 325-359 - 1991
- [j16]Matthew Hennessy:
A Proof Sustem for Communicating Processes with Value-Passing. Formal Aspects 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]S. Arun-Kumar, Matthew Hennessy:
An Efficiency Preorder for Processes. TACS 1991: 152-175 - 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]Matthew Hennessy:
Value-Passing in Process Algebras (Abstract). CONCUR 1990: 31 - [c22]Matthew Hennessy, Tim Regan:
A Temporal Process Algebra. FORTE 1990: 33-48 - [c21]Matthew Hennessy, Anna Ingólfsdóttir:
A Theory of Communicating Processes with Value-Passing. ICALP 1990: 209-219
1980 – 1989
- 1989
- [j14]Ilaria Castellani, Matthew Hennessy:
Distributed bisimulations. J. ACM 36(4): 887-911 (1989) - [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]Luca Aceto, Matthew Hennessy:
Towards Action-Refinement in Process Algebras. LICS 1989: 138-145 - [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]Matthew Hennessy:
Axiomatising Finite Concurrent Processes. SIAM J. Comput. 17(5): 997-1017 (1988) - [c16]Rance Cleaveland, Matthew Hennessy:
Priorities in Process Algebras. LICS 1988: 193-202 - [c15]Matthew Hennessy:
Observing processes. REX Workshop 1988: 173-200 - 1987
- [j12]Matthew Hennessy:
An Algebraic Theory of Fair Synchronous Communicating Processes. Theor. Comput. Sci. 49: 121-143 (1987) - [c14]Rocco De Nicola, Matthew Hennessy:
CCS without tau's. TAPSOFT, Vol.1 1987: 138-152 - 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. Inf. 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]Matthew Hennessy:
Acceptance Trees. J. ACM 32(4): 896-928 (1985) - [c12]Matthew Hennessy:
An Algebraic Theory of Fair Asynchronous Communicating Processes. ICALP 1985: 260-269 - 1984
- [j7]Matthew Hennessy:
Axiomatising Finite Delay Operators. Acta Informatica 21: 61-88 (1984) - [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]Matthew Hennessy:
Modelling Fair Processes. STOC 1984: 25-30 - 1983
- [j5]Matthew Hennessy:
Synchronous and Asynchronous Experiments on Processes. Inf. Control. 59(1-3): 36-83 (1983) - [c9]Rocco De Nicola, Matthew Hennessy:
Testing Equivalence for Processes. ICALP 1983: 548-560 - [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. Inf. Control. 51(1): 58-75 (1981) - [c6]Matthew Hennessy, Wei 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]Matthew Hennessy, Robin Milner:
On Observing Nondeterminism and Concurrency. ICALP 1980: 299-309 - [c4]Matthew Hennessy, Gordon D. Plotkin:
A Term Model for CCS. MFCS 1980: 261-274
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]Matthew Hennessy, Edward A. Ashcroft:
The Semantics of Nondeterminism. ICALP 1976: 478-493
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:17 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
