Matthew Hennessy
Personal Research Chair, School Office - Computer Science & Stats

Publications and Further Research Outputs

Peer-Reviewed Publications

Vasileios Koutavas, Maciej Gazda, Matthew Hennessy, Distinguishing between Communicating Transactions, Information and Computation, 2017 Journal Article, 2017

Bernardi, G., Hennessy, M., Modelling session types using contracts, Mathematical Structures in Computer Science, 26, (3), 2016, p510-560 Journal Article, 2016 DOI

Cerone, A., Hennessy, M., Merro, M., Modelling Mac-Layer communications in wireless systems, Logical Methods in Computer Science, 11, (1), 2015, p18 Journal Article, 2015 DOI TARA - Full Text

Bernardi G, Hennessy M, Mutually testing processes, Logical Methods in Computer Science, 11, (2), 2015, p61-75 Journal Article, 2015 TARA - Full Text DOI URL

Bernardi G, Hennessy M, Compliance and testing preorders differ, Lecture Notes in Computer Science (including subseries Lecture Notes in Ar, 8368, 2014, p69-81 Journal Article, 2014 URL DOI

Cerone A, Hennessy M, Characterising testing preorders for broadcasting distributed systems, Lecture Notes in Computer Science (including subseries Lecture Notes in Ar, 8902, 2014, p67-81 Journal Article, 2014 URL DOI

Francalanza A, Devries E, Hennessy M, Compositional reasoning for explicit resource management in channel-based concurrency, Logical Methods in Computer Science, 10, (2), 2014, p15 Journal Article, 2014 URL TARA - Full Text DOI

Bernardi G, Hennessy M, Using higher-order contracts to model session types (extended abstract), Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST, 8704, 2014, p387-401 Journal Article, 2014 URL DOI

Vasileios Koutavas and Carlo Spaccasassi and Matthew Hennessy, Bisimulations for Communicating Transactions (Extended Abstract), Lecture Notes in Computer Science, Foundations of Software Science and Computation Structures, Grenoble, France, 5-13 April 2014, edited by Muscholl, Anca , 8412, Springer Berlin Heidelberg, 2014, pp320 - 334 Conference Paper, 2014 DOI URL

Yuxin Deng and Matthew Hennessy., On the Semantics of Markov Automata., Information and Computation, 222, 2013, p139-168 Journal Article, 2013 DOI

Bernardi, G., Hennessy, M., Mutually testing processes (extended abstract), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics, 24th International Conference on Concurrency Theory, CONCUR 2013, Argentina, edited by 27-30 Aug , 8052, 2013, pp61-75 Conference Paper, 2013 DOI

Cerone, A., Hennessy, M., Merro, M., Modelling MAC-layer communications in wireless systems (extended abstract), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) , 15th International Conference on Coordination Models and Languages, COORDINATION 2013, Held as Part of the 8th International Federated Conference on Distributed Computing Techniques, DisCoTec 2013;, Florence, 3-5 June, 7890, 2013, pp16-30 Conference Paper, 2013 DOI

Deng, Y., Hennessy, M., Compositional reasoning for weighted Markov decision processes, Science of Computer Programming , 2013 Journal Article, 2013 TARA - Full Text DOI

Deng, Y., van Glabbeek, R., Hennessy, M., Morgan, C., Real-reward testing for probabilistic processes, Theoretical Computer Science , 538, 2013, p16-36 Journal Article, 2013 TARA - Full Text DOI

Cerone, A., Hennessy, M., Modelling probabilistic wireless networks, Logical Methods in Computer Science , 9, (3), 2013, part. no. 26 Journal Article, 2013 TARA - Full Text DOI

Koutavas, V., Hennessy, M., Symbolic bisimulation for a higher-order distributed language with passivation (extended abstract), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 24th International Conference on Concurrency Theory, CONCUR 2013, Argentina, 27-30 Aug, 8052, 2013, pp167-181 Conference Paper, 2013 DOI TARA - Full Text

Giovanni Bernardi and Matthew Hennessy. , Modelling session types using contracts. , Proceedings of the ACM Symposium on Applied Computing, ACM Symposium on Applied Computing, Riva, Trento, Italy, March 26-30, edited by Sascha Ossowski and Paola Lecca , 2012, ACM, 2012, pp1941-1946 Conference Paper, 2012 DOI

Edsko de Vries and Adrian Francalanza and Matthew Hennessy., Uniqueness Typing for Resource Management in Message-Passing Concurrency. , Journal of Logic and Computation, 24, (3), 2012, p531-556. Journal Article, 2012 DOI TARA - Full Text

Deng, Y., Hennessy, M., Compositional reasoning for Markov decision processes, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) , 7141 , 2012, p143-157 Journal Article, 2012 DOI

Andrea Cerone and Matthew Hennessy. , Modelling Probabilistic Wireless Networks - (Extended Abstract). , Lecture Notes in Computer Science, Proceedings of Formal Techniques for Distributed Systems - Joint 14th IFIP WG 6.1 International Conference, FMOODS 2012 and 32nd IFIP WG 6.1 International Conference, FORTE 2012, Holger Giese and Grigore Rosu, 7273, 2012, pp135-151 Conference Paper, 2012 DOI

Vasileios Koutavas and Matthew Hennessy, First-Order Reasoning for Higher-Order Concurrency. , Journal of Computer Languages, Systems and Structures, 38, (3), 2012, p242-277 Journal Article, 2012 TARA - Full Text DOI

Matthew Hennessy, Exploring probabilistic bisimulations, part I., Formal Aspects of Computing, 24, (4-6), 2012, p749-768 Journal Article, 2012 DOI DOI

Yuxin Deng and Matthew Hennessy., On the Semantics of Markov Automata, Lecture Notes in Computer Science, The 38th International Colloquium on Automata, Languages and Programming (ICALP11), Zurich, Switzerland, July 4-8, 2011, edited by Luca Aceto and Monika Henzinger and Jiri Sgall , 6756, Springer-Verlag, 2011, pp307 - 318 Conference Paper, 2011 DOI URL

Vasileios Koutavas and Matthew Hennessy., A Testing Theory for a Higher-Order Cryptographic Language, 20th European Symposium on Programming (ESOP'11) , Saarbrucken, Germany, March, 2011 Conference Paper, 2011 TARA - Full Text URL DOI

Yuxin Deng, Rob vanGlabbeek, Matthew Hennessy and Carroll Morgan , Real Reward Testing for Probabilistic Processes, Ninth Workshop on Quantitative Aspects of Programming Languages (QAPL 2011) , Saarbrucken, Germany, April , 2011 Conference Paper, 2011 URL DOI TARA - Full Text

Yuxin Deng and Matthew Hennessy., Compositional Reasoning for Markov Decision Processes, To be presented at Fundamentals of Software Engineering, Tehran, Iran, April, 2011 Conference Paper, 2011 TARA - Full Text URL

Matthew Hennessy., A calculus for costed computations, Logical Methods in Computer Science, 2011, p1-35 Journal Article, 2011 TARA - Full Text DOI URL

Edsko de Vries, Vasileios Koutavas and Matthew Hennessy., Liveness of Communicating Transactions (Extended Abstract) , 6461, 2010, pp392-407 Conference Paper, 2010 DOI TARA - Full Text

Edsko de Vries, Adrian Francalanza and Matthew Hennessy., Uniqueness Typing for Resource Management in Message-Passing Concurrency., First International Workshop on Linearity (LINEARITY 2009). Electronic Proceedings in Theoretical Computer Science, First International Workshop on Linearity (LINEARITY 2009), Coimbra, Portugal , September 2009, edited by M. Florido and I. Mackie , 22, 2010, pp26-37 Conference Paper, 2010 TARA - Full Text URL

Edsko de Vries, Vasileios Koutavas and Matthew Hennessy., Communicating Transactions , Lecture Notes in Computer Science, 21st International Conference on Concurrency Theory (CONCUR 2010), Paris, France, 6269, (2010), Springer, 2010, pp569-583 Conference Paper, 2010 DOI TARA - Full Text

Andrea Cerone and Matthew Hennessy, Process Behaviour: Formulae vs. Tests, Proceedings 17th International Workshop on Expressiveness in Concurrency, Electronic Proceedings in Theoretical Computer Science, 17th International Workshop on Expressiveness in Concurrency (Express'10) , Paris, France, August 2010, edited by Sibylle Fröschle and Frank D. Valencia , 41, 2010, pp31-45 Conference Paper, 2010 TARA - Full Text DOI

Matthew Hennessy and Manish Gaur., Counting the cost in the picalculus., Proceedings of 1st Interaction and Concurrency Experience (ICE'08) , Electronic Notes in Theoretical Computer Science, 1st Interaction and Concurrency Experience (ICE'08), Reykjavik, Iceland, July 2008, 229, (3), Elsevier Science Publishers B. V, 2009, pp117-129 Conference Paper, 2009 TARA - Full Text DOI

Yuxin Deng and Rob van Glabbeek and Matthew Hennessy and Carroll Morgan. , Testing Finitary Probabilistic Processes , 20th International Conference on Concurrency Theory (CONCUR'09), Bologna, Italy, September , 2009 Conference Paper, 2009 URL DOI TARA - Full Text

Vasileios Koutavas and Matthew Hennessy., First-Order Reasoning for Higher-Order Concurrency, Computer Science Department Technical Report, July , 2009 Report, 2009 URL TARA - Full Text

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 , 5065/2008, 2008, p757-777 Journal Article, 2008 TARA - Full Text DOI URL

Francalanza, A, Hennessy, M., A theory of system behaviour in the presence of node and link failure, Information and Computation , 206, (6), 2008, p711 - 759 Journal Article, 2008 DOI TARA - Full Text

Matthew Hennessy, A Distributed Picalculus, Cambridge University Press, 2007 Book, 2007 DOI

Yuxin Deng and Rob van Glabbeek and Matthew Hennessy and Carroll Morgan and Chenyi Zhang., Characterising Testing Preorders for Finite Probabilistic Processes, Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science, 22nd Annual IEEE Symposium on Logic in Computer Science, edited by IEEE Computer Society , 171, 2007, pp313-325 Conference Paper, 2007 TARA - Full Text DOI URL

Adrian Francalanza and Matthew Hennessy, A Fault Tolerance Bisimulation Proof for Consensus. , Proc. of 16th European Symposium, 16th European Symposium of Lecture Notes in Computer Science, March 2007, 4421 , 2007, pp395-410 Conference Paper, 2007 URL DOI

Hym, S., Hennessy, M., Adding recursion to Dpi , Theoretical Computer Science , 373, (3), 2007, p182-212 Journal Article, 2007 URL DOI

Deng, Y. , van Glabbeek, R. , Hennessy, M. , Morgan, C. , Zhang, C., Remarks on Testing Probabilistic Processes , Electronic Notes in Theoretical Computer Science , 172, 2007, p359-397 Journal Article, 2007 DOI TARA - Full Text

Francalanza, A, Hennessy, M., A theory for observational fault tolerance, Journal of Logic and Algebraic Programming, 73, (1-2), 2007, p22-50 Journal Article, 2007 DOI TARA - Full Text

A fault tolerance bisimulation proof for consensus in, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) , Springer, 2007, pp395-410 , [Francalanza, A, Hennessy, M. ] Book Chapter, 2007 URL DOI

Hym, S. , Hennessy, M., Adding Recursion to Dpi. (Extended Abstract) , 2006, - 115-133 Miscellaneous, 2006 TARA - Full Text

A theory for observational fault tolerance in, Lecture Notes in Computer Science , Springer, 2006, 16-31 , [Francalanza, A. , Hennessy, M.] Book Chapter, 2006 DOI URL

Adrian Francalanza and Matthew Hennessy, A Theory of System Fault Tolerance, Lecture Notes in Computer Science, Fossacs06 , 2006, 3921 , 2006, pp16-31 Conference Paper, 2006 URL

Merro, M., Hennessy, M., A bisimulation-based semantic theory of Safe Ambients , ACM Transactions on Programming Languages and Systems , 28, (2), 2006, p290-330 Journal Article, 2006 URL DOI

Gorla, D., Hennessy, M. , Sassone, V., Inferring dynamic credentials for rôle-based trust management , Symposium on Principles and Practice of Declarative Programming , Proceedings of the Eight ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming , Volume 2006, ACM, 2006, pp213-224 Conference Paper, 2006 URL TARA - Full Text

Hennessy, M., Rathke, J., Yoshida, N. , SAFEDPI: A language for controlling mobile code , Acta Informatica , 42, (4-5), 2005, p227-290 Journal Article, 2005 DOI TARA - Full Text

Hennessy, Matthew., The Security Picalculus and Non-interference., Journal of Logic and Algebraic Programming, 63, (1), 2005, p3-34 Journal Article, 2005 TARA - Full Text DOI

Proof methodologies for behavioural equivalence in DPI in, Lecture Notes in Computer Science , Berlin, Heidelberg, Springer , 2005, pp335-350 , [Alberto Ciaffaglione, Matthew Hennessy and Julian Rathke] Book Chapter, 2005 TARA - Full Text URL DOI

Adrian Francalanza and Matthew Hennessy., A Theory of System Behaviour in the Presence of Node and Link Failures , Proceedings of CONCUR05, CONCUR 05, 2005, 2005, pp368-382 Conference Paper, 2005 DOI URL

Eidenbenz, S., Hennessy, M., Morales, R., Triguero, F., Widmayer, P., Conejo, R., Theoretical Computer Science: Preface , Theoretical Computer Science , Foundations of Wide Area Network Computing , 312, (1), 2004, ppPages 1-2 Conference Paper, 2004 URL DOI

Matthew Hennessy and Julian Rathke and Nobuko Yoshida. , SafeDpi: A Language for Controlling Mobile Code (extended abstract)., Lecture Notes in Computer Science, FOSSACS04, 2987, Springer-Verlag, 2004, pp241-256 Conference Paper, 2004 DOI URL URL

Matthew Hennessy and Massimo Merro and Julian Rathke., Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems., Theoretical Computer Science, 322, (3), 2004, p615--669 Journal Article, 2004 TARA - Full Text DOI

Hennessy, M. , Rathke, J. , Yoshida, N., SAFEDPI: A language for controlling mobile code (extended abstract) , 2004, - 241-256 Miscellaneous, 2004 URL DOI

Daniele Gorla and Matthew Hennessy and Vladimiro Sassone. , Security Policies as Membranes in Systems for Global Computing, Proceedings of 3rd EATCS Workshop on Foundations of Global Ubiquitous Computing, 3rd EATCS Workshop on Foundations of Global Ubiquitous Computing (FGUC'04), 9 September 2005, , 138, (1), Elsevier, 2004, pp23-42 Conference Paper, 2004 DOI TARA - Full Text

Matthew Hennessy and Julian Rathke. , Typed behavioural equivalences for processes in the presence of subtyping., Mathematical Structures in Computer Science, 14, (5), 2004, p651-684 Journal Article, 2004 URL DOI

Matthew Hennessy. , The Security Picalculus and Non-interference (extended abstract). , Conference Record of MFPSXIX, MFPSXIX, 2003., 2003 Conference Paper, 2003 URL DOI

Matthew Hennessy and James Riely., Trust and partial typing in open systems of mobile agents., Journal of Automated Reasoning, 31, (304), 2003, p335-370 Journal Article, 2003 DOI URL

Towards a behavioural theory of access and mobility control in distributed systems: (Extended abstract) in, , Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) , Berlin, Springer, 2003, pp282-298 , [Hennessy, M. , Merro, M. , Rathke, J.] Book Chapter, 2003 URL DOI

Matthew Hennessy and Massimo Merro and Julian Rathke., Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems (extended abstract). , Lecture Notes in Computer Science, FOSSACS03, 2620, Springer-Verlag, 2003, pp282-298 Conference Paper, 2003 DOI URL

Matthew Hennessy and James Riely., Information flow vs resource access in the asynchronous pi-calculus., ACM Transactions on Programming Languages and Systems, 24, (5), 2002, p556-591 Journal Article, 2002 TARA - Full Text URL DOI

Matthew Hennessy and James Riely. , Resource access control in systems of mobile agents., Information and Computation, 173, 2002, p82-120 Journal Article, 2002 DOI URL

Nobuko Yoshida and Matthew Hennessy, Assigning types to processes., Information and Computation, 174, (2), 2002, p143-179 Journal Article, 2002 URL DOI

Massimo Merro and Matthew Hennessy., Bisimulation Congruences in Safe Ambients (extended abstract)., Conference Record of POPL '02: The 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 29th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2002, pp71-80 Conference Paper, 2002 URL DOI TARA - Full Text

Matthew Hennessy and Julian Rathke., Typed behavioural equivalences for processes in the presence of subtyping (extended abstract). , Electronic Notes in Theoretical Computer Science, CATS02 - Computing: the Australasian Theory Symposium , edited by James Harland , 61, Elsevier Science Publishers, 2002, pp122-139 Conference Paper, 2002 DOI URL

Matthew Hennessy, Huimin Lin and Julian Rathke. , Unique Fixpoint Induction for Message-Passing Process Calculi. , Science of Computer Programming. , 41, (3), 2001, p241-275 Journal Article, 2001 DOI URL

Matthew Hennessy., A fully abstract denotational semantics for the pi-calculus. , Theoretical Computer Science, 278, (1-2), 2001, p53-89 Journal Article, 2001 DOI URL

James Riely and Matthew Hennessy., Distributed Processes and Location Failures., Theoretical Computer Science, 226, (1-2), 2001, p693-735 Journal Article, 2001 URL DOI

Matthew Hennessy and James Riely., Information Flow vs Resource Access in the Asynchronous Pi-calculus , Lecture Notes in Computer Science, Automata, Languages and Programming, 27th International Colloquium, Geneva, Switzerland,, 9-15 July , edited by U. Montanari and J. Rolim and E. Welzl , 1853, (2000), Springer, 2000, pp415-427 Conference Paper, 2000 URL DOI

Nobuko Yoshida and Matthew Hennessy., Assigning Types to Processes, Proceedings, Fifteenth Annual IEEE Symposium on Logic in Computer Science, IEEE Symposium on Logic in Computer Science, Santa barbara, 26-28 June 2000, IEEE Computer Society Press. , 2000, pp334-348 Conference Paper, 2000 DOI URL TARA - Full Text

William Ferreira and Matthew Hennessy., A Behavioural theory of first-order cml. , Theoretical Computer Science. , 216, (1-2), 1999, p55-107 Journal Article, 1999 DOI URL

Matthew Hennessy and James Riely., Type-safe execution of mobile agents in anonymous networks (Extended Abstract)., Lecture Notes in Computer Science, Secure Internet Programming: Proc. of 4th Workshop on Mobile Object Systems, Brussels, 1998, 1603, Springer-Verlag , 1999, pp95-115 Conference Paper, 1999 URL DOI TARA - Full Text

James Riely and Matthew Hennessy. , Trust and Partial Typing in Open Systems of Mobile Agents (extended abstract). , Conference Record of POPL '99:, POPL '99: The 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages,, San Antonio, Texas, 20-22 January 1999, ACM, 1999, pp93-104 Conference Paper, 1999 DOI URL

Nobuko Yoshida and Matthew Hennessy., Subtyping and Locality in Distributed Higher Order Mobile Processes (extended abstract). , Lecture Notes in Computer Science, Proceedings of of CONCUR'99, 1664, Springer-Verlag, 1999, pp557-572 Conference Paper, 1999 URL TARA - Full Text DOI

Chrysafis Hartonas and Matthew Hennessy., Full abstractness for a functional/concurrent language with higher-order value-passing., Information and Computation., 145, (1), 1998, p64-106 Journal Article, 1998 DOI URL

James Riely and Matthew Hennessy., A typed language for distributed mobile processes (extended abstract). , Conference Record of POPL '98: The 25th ACM SIGPLAN-SIGACT , POPL '98: The 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages,, San Diego, California, 19-21 January 1998. , 1998, pp378-390 Conference Paper, 1998 URL DOI

Ilaria Castellani and Matthew Hennessy. , Testing Theories for Asynchronous Languages., Lecture Notes in Computer Science , Proc. FST-TCS98, Madras , December 1998, 1530, Springer-Verlag, 1998, pp90-101 Conference Paper, 1998 URL

M. Hennessy and J. Rathke., Bisimulations for a calculus of broadcasting systems., Theoretical Computer Science, 200, (1-2), 1998, p225-260 Journal Article, 1998 DOI URL

William Ferreira, Matthew Hennessy and Alan Jeffrey., A theory of weak bisimulation for core cml. , Journal of Functional Programming. , 8, (5), 1998, p447-491 Journal Article, 1998 URL DOI

Matthew Hennessy and James Riely. , Resource access control in systems of mobile agents (Extended Abstract)., Proceedings of 3rd International Workshop on High-Level Concurrent Languages, Proc. of 3rd International Workshop on High-Level Concurrent Languages (HLCL'98):, Nice, 16, (3), 1998, pp174-188 Conference Paper, 1998 TARA - Full Text

J. Rathke and M. Hennessy., Local model checking for value-passing processes. , Proc. TACS'97, International Symposium on Theoretical Aspects of Computer Software, TACS'97, Sendai., 1281/1997, Springer-Verlag, 1997, pp250-266 Conference Paper, 1997 DOI URL

A. Kiehn and M. Hennessy., On the decidability of non-interleaving process equivalences., Fundamenta Informaticae, 30, (1), 1997, p18-33 Journal Article, 1997

Matthew Hennessy, and Huimin Lin., Unique Fixpoint Induction for Message-Passing Process Calculi, Proceedings of CATS'97, Australia Computer Science Communications, CATS'97, Australia Computer Science Communications , Sidney, May 1997, 1997, pp122-131 Conference Paper, 1997 URL

James Riely and Matthew Hennessy. , Distributed processes and location failures (extended abstract). , Lecture Notes in Computer Science, Automata, Languages and Programming, 24th International Colloquium, Bologna, Italy, 7-11 July 1997., edited by Pierpaolo Degano, Robert Gorrieri, and Alberto Marchetti-Spaccamela , 1256, Springer-Verlag. , 1997, pp471-481 Conference Paper, 1997 DOI URL

M Hennessy and H Lin, Proof systems for message-passing process algebras., Formal Aspects of Computing, 8, (4), 1996, p379-407 Journal Article, 1996 DOI URL

William Ferreira, Matthew Hennessy, and Alan Jeffrey, A theory of weak bisimulation for core CML., Proceedings of the 1996 ACM SIGPLAN International Conference on Functional Programming, ACM SIGPLAN International Conference on Functional Programming, Philadelphia, Pennsylvania, 24-26 May 1996. , ACM, 1996, pp201-212 Conference Paper, 1996 URL DOI

M. Hennessy and H. Lin., Symbolic bisimulations., Theoretical Computer Science, 138, (2), 1995, p353-389 Journal Article, 1995 URL DOI

Matthew Hennessy., Concurrent testing of processes., Acta Informatica, 32, (6), 1995, p509-543 Journal Article, 1995 DOI URL

M. Hennessy and J. Rathke., Bisimulations for a calculus of broadcasting systems, Lecture Notes in Computer Science, : Concurrency Theory, 6th International Conference, Philadelphia, Pennsylvania, 21-24 August 1995, edited by Insup Lee and Scott A. Smolka , Springer-Verlag, 1995, pp486-500 Conference Paper, 1995 URL DOI

Matthew Hennessy and Tim Regan., A process algebra for timed systems. , Information and Computation,, 117, (2), 1995, p221-239 Journal Article, 1995 DOI URL

W. Ferreira and M. Hennessy. , Towards a semantic theory of CML , Lecture Notes in Computer Science, Mathematical Foundations of Computer Science 1995, 20th International Symposium, Prague, Czech Republic, 1 Sept-28 Aug, edited by Jir'ý Wiedermann and Petr H'ajek , 969, Springer., 1995, pp454-466 Conference Paper, 1995 URL DOI

Astrid Kiehn and Matthew Hennessy. , On the decidability of non-interleaving process equivalences, Lecture Notes in Computer Science, CONCUR '94: Concurrency Theory, 5th International Conference, Uppsala, Sweden, 22-25 August 1994., edited by Bengt Jonsson and Joachim Parrow , 836, Springer-Verlag., 1994, pp18-33 Conference Paper, 1994 URL DOI

Matthew Hennessy., Higher-order process and their models, Lecture Notes in Computer Science, Automata Languages and Programming, 21st International Colloquium, Jerusalem, Israel, 11-14 July 1994, edited by Serge Abiteboul and Eli Shamir , 820, Springer-Verlag., 1994, pp286-303 Conference Paper, 1994

M. Hennessy. , A fully abstract denotational model for higher-order processes., Information and Computation, 112, (1), 1994, p55-95 Journal Article, 1994 DOI URL

L. Aceto and M. Hennessy., Adding action refinement to a finite process algebra. , Information and Computation, 115, (2), 1994, p179-247 Journal Article, 1994 URL DOI

G Boudol, I Castellani, M Hennesy, and A Kiehn., A theory of processes with localities. , Formal Aspects of Computing, 6, (2), 1994, p165-200 Journal Article, 1994 URL DOI

M. Hennessy and A. Ing'olfsd'ottir., A theory of communicating processes with value passing., Information and Computation, 107, (2), 1993, p202-236 Journal Article, 1993 URL DOI

G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn., Observing localities., Theoretical Computer Science, 114, (1), 1993, p31-61 Journal Article, 1993 DOI URL

M. Hennessy., A fully abstract denotational model for higher-order processes , Proceedings, Eighth Annual IEEE Symposium on Logic in Computer Science, Eighth Annual IEEE Symposium on Logic in Computer Science, Montreal, Canada,, 19-23 June 1993, IEEE Computer Society Press., 1993, pp397-408 Conference Paper, 1993 URL DOI

Rance Cleaveland and Matthew Hennessy., Testing equivalence as a bisimulation equivalence., Formal Aspects of Computing, 5, (1), 1993, p1-20 Journal Article, 1993 DOI URL

Matthew Hennessy. , Symbolic bisimulations , Lecture Notes in Computer Science, Mathematical Foundations of Computer Science 1993, 18th International Symposium, Gdansk, Poland, 30 August-3 Sept, edited by Andrzej M. Borzyszkowski and Stefan Sokolowski , 711, Springer, 1993, pp83 Conference Paper, 1993 URL DOI

M Hennessy and A Ing'olfsd'ottir., Communicating processes with value-passing and assignments. , Formal Aspects of Computing, 5, (5), 1993, p432-466 Journal Article, 1993 URL DOI

M. Hennessy and H. Lin, Proof systems for message-passing process algebras, Lecture Notes in Computer Science, CONCUR '93: 4th International Conference on Concurrency Theory, Hildesheim, Germany, 23-26 August, edited by Eike Best , 715, Springer-Verlag, 1993, pp202-216 Conference Paper, 1993 DOI URL

L. Aceto and M. Hennessy. , Towards action-refinement in process algebras., Information and Computation, 103, (2), 1993, p204-269 Journal Article, 1993 URL DOI

L. Aceto and M. Hennessy., Termination, deadlock, and divergence., Journal of the ACM, 39, (1), 1992, p147-187 Journal Article, 1992 URL DOI

M. Hennessy. , Concurrent testing of processes , Lecture Notes in Computer Science, CONCUR '92: Third International Conference on Concurrency Theory, Stony Brook, New York, 24- 27August 1992., edited by W. R. Cleaveland , 630, Springer-Verlag, 1992, pp94-107 Conference Paper, 1992 URL DOI

S. Arun-Kumar and M. Hennessy., An efficiency preorder for processes. , Acta Informatica, 29, (8), 1992, p737-760 Journal Article, 1992 URL DOI

G. Boudol, I. Castellani, M. Hennessy, and A. Kiehn., A theory of processes with localities, Lecture Notes in Computer Science, CONCUR '92: Third International Conference on Concurrency Theory, Stony Brook, New York, 24-27August 1992, edited by W. R. Cleaveland , Springer-Verlag, 1992, pp108-122 Conference Paper, 1992 URL DOI

Gerard Boudol, Ilaria Castellani, Matthew Hennessy, and Astrid Kiehn. , Observing localities , Lecture Notes in Computer Science, Mathematical Foundations of Computer Science , Kazimierz Dolny, Poland, September 9-13, edited by Andrzej Tarlecki , 520, Springer, 1991, pp93-102 Conference Paper, 1991 URL DOI

M Hennessy. , A proof system for communicating processes with value-passing., Formal Aspects of Computing,, 3, (4), 1991, p346-366 Journal Article, 1991 URL DOI

Luca Aceto and Matthew Hennessy. , Adding action refinement to a finite process algebra, Lecture Notes in Computer Science, , Automata, Languages and Programming, 18th International Colloquium, Madrid, Spain, 8-12 July 1991, edited by Javier Leach Albert, Burkhard Monien, and Mario Rodr'ýguez-Artalejo , 510 , Springer-Verlag, 1991, pp506-519 Conference Paper, 1991 URL DOI

S. Arun-Kumar and M. Hennessy., An efficiency preorder for processes, Lecture Notes in Computer Science, Theoretical Aspects of Computer Software, 1991, 526, Springer -Verlag, 1991, pp152-175 Conference Paper, 1991 URL DOI

Matthew Hennessy., The Semantics of Programming Languages: an Elementary Introduction using Structural Operational Semantics. , New York, N.Y., John Wiley and Sons, 1990 Book, 1990

Matthew Hennessy and Anna Ing'olfsd'ottir, A theory of communicating processes with value-passing, Lecture Notes in Computer Science, Automata, Languages and Programming, 17th International Colloquium, Warwick University, England, 16-20 July 1990., edited by Michael S. Paterson , 443 , Springer-Verlag, 1990, pp209-219 Conference Paper, 1990 URL DOI

R. Cleaveland and M. Hennessy. , Testing equivalence as a bisimulation equivalence, Lecture Notes in Computer Science , Proceedings of the International Workshop on Automatic Verification Methods for Finite State Systems, Berlin, June 1990., edited by J. Sifakis , 407, Springer, 1990, pp11-23 Conference Paper, 1990 URL DOI

Rance Cleaveland and Matthew Hennessy, Priorities in process algebras., Information and Computation, 87, (1-2), 1990, p58-77 Journal Article, 1990 DOI

Matthew Hennessy and Anna Ing'olfsd'ottir, A theory of communicating processes with value-passing, Lecture Notes in Computer Science, Automata, Languages and Programming, 17th International Colloquium, Warwick University, England, 16-20 July 1990., edited by Michael S. Paterson , 443 , Springer-Verlag, 1990, pp209-219 Conference Paper, 1990 URL DOI

M. Hennessy. , Value-passing in process algebras , Lecture Notes in Computer Science, CONCUR '90: Theories of Concurrency: Unification and Extension, Amsterdam, The Netherlands,, 27-30 August 1990, edited by J. C. M. Baeten and J. W. Klop , 458, Springer-Verlag, 1990, pp31 Conference Paper, 1990 URL DOI

M. Hennessy., A proof system for communicating processes with value-passing, Lecture Notes in Computer Science, Foundations of Software Technology and Theoretical Computer Science, Berlin - Heidelberg - New York, December 1989, Springer., 1989, pp325-339 Conference Paper, 1989 URL DOI

Ilaria Castellani and Matthew Hennessy., Distributed bisimulations. , Journal of the ACM,, 36, (4), 1989, p887-911 Journal Article, 1989 URL DOI

M. Hennessy. , Observing processes, Lecture Notes in Computer Science , Proceedings of the School/Workshop on Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, Berlin,, May 30 June-3, edited by J. W. de Bakker, W.-P. de Roever, and G. Rozenberg , 354, Springer. , 1989, pp173-200 Conference Paper, 1989 URL DOI

L. Aceto and M. Hennessy. , Towards action-refinement in process algebras., Proceedings, Fourth Annual Symposium on Logic in Computer Science, Asilomar Conference Center, Pacific Grove California, 5-8 June 1989, IEEE Computer Society Press. , 1989, pp138-145 Conference Paper, 1989 URL DOI TARA - Full Text

Matthew Hennessy. , Axiomatising finite concurrent processes. , SIAM Journal on Computing, 17, (5), 1988, p997-1017 Journal Article, 1988 DOI URL

Rance Cleaveland and Matthew Hennessy. , Priorities in process algebras., Proceedings of Third Annual Symposium on Logic in Computer Science, Third Annual Symposium on Logic in Computer Science, Edinburgh, Scotland, 5-8 July 1988, IEEE Computer Society, 1988, pp193-202 Conference Paper, 1988 DOI URL TARA - Full Text

Matthew Hennessy, Algebraic Theory of Processes, Cambridge, Mass, The MIT Press, 1988 Book, 1988

Matthew Hennessy., An algebraic theory of fair asynchronous communicating processes. , Theoretical Computer Science, 49, (2-3), 1987, p121-143 Journal Article, 1987 DOI

M. Hennessy. , Communication primitives in programming and specification languages, Lecture notes in computer science, In Networking in Open Systems, IBM Europe Institute, Oberlech, August 1986., 248, Springer-Verlag, 1987, pp224-251 Conference Paper, 1987 DOI URL

R. De Nicola and M. Hennessy. , CCS without taus., Lecture Notes in Computer Science, Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT '87). , Pisa, Italy, March 1987., edited by Giorgio Levi Hartmut Ehrig, Robert Kowalski and Ugo Mantanari , 249 , Springer, 1987, pp138-152 Conference Paper, 1987

Matthew Hennessy. , Proving systolic systems correct. , ACM Transactions on Programming Languages and Systems, 8, (3), 1986, p344-387 Journal Article, 1986 DOI URL

M. Hennessy. , Acceptance trees. , Journal of the ACM, 32, (4), 1985, p896-928 Journal Article, 1985 URL DOI

Matthew Hennessy and Robin Milner. , Algebraic laws for nondeterminism and concurrency., Journal of the ACM, 32, (1), 1985, p137-161 Journal Article, 1985 URL DOI

Matthew Hennessy. , An algebraic theory of fair asynchronous communicating processes, Lecture Notes in Computer Science, Automata, Languages and Programming, 12th Colloquium, Nafplion, Greece, 15-19 July , edited by Wilfried Brauer , 194/1985, Springer-Verlag., 1985, pp260-269 Conference Paper, 1985 URL DOI

Matthew Hennessy and Colin Stirling., The power of the future perfect in program logics. , Information and Control, 67, (1-3), 1985, p23-52 Journal Article, 1985 DOI

Matthew Hennessy. , Modelling fair processes., Proceedings of the Sixteenth Annual ACM Symposium on Theory of Computing,, Sixteenth Annual ACM Symposium on Theory of Computing,, Washington, D.C., , ACM, 1984, pp25-30 Conference Paper, 1984 URL DOI

M. Hennessy and C. Stirling., The power of the future perfect in program logics., Lecture Notes in Computer Science, Mathematical Foundations of Computer Science , Praha, Czechoslovakia, 3-7 September, edited by M. P. Chytil and V. Koubek , 176, Springer-Verlag., 1984, pp301-311 Conference Paper, 1984 URL DOI

R. De Nicola and M. C. B. Hennessy., Testing equivalences for processes., Theoretical Computer Science,, 34, (1-2), 1984, p83-133 Journal Article, 1984 DOI URL

Matthew Hennessy., Axiomatising finite delay operators, Acta Informatica, 21, (1), 1984, p61-88 Journal Article, 1984 URL DOI

M. Hennessy., Synchronous and asynchronous experiments on processes. , Information and Control, 59, (1-3), 1983, p36-83 Journal Article, 1983 URL DOI

Rocco De Nicola and Matthew C. B. Hennessy., Testing equivalence for processes, Lecture Notes in Computer Science, Automata, Languages and Programming, 10th Colloquium,, Barcelona, Spain, 18-22 July , edited by Josep D'ýaz , 154, Springer-Verlag, 1983, pp548-560 Conference Paper, 1983 URL DOI

Matthew Hennessy. , Powerdomains and nondeterministic recursive definitions., Lecture Notes in Computer Science, international symposium on programming, 137/1982, Springer-Verlag, 1982, pp178-193 Conference Paper, 1982 URL DOI

Matthew Hennessy. , A term model for synchronous processes., Information and Control, 51, (1), 1981, p58-75 Journal Article, 1981 URL DOI

M. C. B. Hennessy and E. A. Ashcroft. , A mathematical semantics for a nondeterministic typed lambda-calculus. , Theoretical Computer Science, 11, (3), 1980, p227-245 Journal Article, 1980

M. C. B. Hennessy. , The semantics of call-by-value and call-by-name in a nondeterministic environment. , SIAM Journal on Computing, 9, (1), 1980, p67-84 Journal Article, 1980 URL DOI

Matthew C. B. Hennessy and Robin Milner., On observing nondeterminism and concurrency., Lecture Notes in Computer Science, Automata, Languages and Programming, 7th Colloquium, Noordweijkerhout, The Netherland, 14-18 July 1980, edited by J. W. de Bakker and Jan van Leeuwen , 85, Springer-Verlag, 1980, pp299-309 Conference Paper, 1980 URL DOI

Matthew C. B. Hennessy., A proof system for the first-order relational calculus., Journal of Computer and System Sciences, 20, (1), 1980, p96-110 Journal Article, 1980 DOI URL

Matthew C. B. Hennessy and Gordon D. Plotkin, A term model for CCS, Lecture Notes in Computer Science, Mathematical Foundations of Computer Science , Rydzyna, Poland, 1-5 September 1980, 88, Springer, 1980, pp261-274 Conference Paper, 1980 URL DOI

M. C. B. Hennessy and G. D. Plotkin, Full abstraction for a simple parallel programming language, Lecture Notes in Computer Science, Mathematical Foundations of Computer Science , Olomouc, Czechoslovakia, 3-7 September 1979, edited by J. Beèv'aø , 74, Springer-Verlag. , 1979, pp108-120 Conference Paper, 1979 URL DOI

M. C. B. Hennessy and E. A. Ashcroft. , Parameter-passing mechanisms and nondeterminism, Conference Record of the Ninth Annual ACM Symposium on Theory of Computing, Ninth Annual ACM Symposium on Theory of Computing, Boulder, Colorado, 2-4 May 1977, ACM, 1977, pp306-311 Conference Paper, 1977 URL DOI

M. Hennessy and E. A. Ashcroft. , The semantics of nondeterminism. , Third International Colloquium on Automata, Languages and Programming, University of Edinburgh, 20-23 July 1976, edited by S. Michaelson and R. Milner , (Edinburgh University), Edinburgh University Press, 1976, pp478-493 Conference Paper, 1976

Non-Peer-Reviewed Publications

Vasileios Koutavas, Maciej Gazda, Matthew Hennessy, Distinguishing between Communicating Transactions, CoRR abs/1703.03256, Arxiv - The Computing Research Repository (CoRR), 2017 Report, 2017 URL

Andrea Cerone, Matthew Hennessy and Massimo Merro., Modelling MAC-layer communications in wireless systems., Trinity College, Dublin, Ireland., Trinity College, Dublin, Ireland., September , 2012, 1-48 Report, 2012 DOI TARA - Full Text

Giovanni Bernardi and Matthew Hennessy, Modelling session types using contracts, Trinity College Dublin, 2011 Report, 2011 TARA - Full Text

Yuxin Deng, Matthew Hennessy, Rob J. van Glabbeek, Carroll Morgan, Characterising Testing Preorders for Finite Probabilistic Processes , 2008 Journal Article, 2008 URL DOI

Test, Test TARA Upload2 Working Paper,

Research Expertise

Projects

  • Title
    • MIKADO: Mobile Calculi Based on Domains
  • Summary
    • Two Research Fellows - personnel
  • Funding Agency
    • EU Framework V - Global Computing
  • Date From
    • 01/01/02
  • Date To
    • 30/04/05
  • Title
    • A Distributed Object Calculus and its Implementation
  • Summary
    • Personnel: Visiting Fellowship - Prof. Vasconcelos
  • Funding Agency
    • EPSRC
  • Date From
    • 01/10/02
  • Date To
    • 30/09/03
  • Title
    • The Semantic Foundations of Mobile Computation
  • Summary
    • Personnel: Two Research Fellows
  • Funding Agency
    • EPSRC
  • Date From
    • 01/09/99
  • Date To
    • 31/08/01
  • Title
    • CONFER II Working Group
  • Funding Agency
    • EU Framework IV
  • Date From
    • 01/10/96
  • Date To
    • 30/09/2000
  • Title
    • Linear Type Systems for Distributed Concurrent Systems
  • Funding Agency
    • EPSRC
  • Date From
    • 01/04/98
  • Date To
    • 31/03/00
  • Title
    • Integration of Concurrent, Functional and Distributed Computation
  • Summary
    • Personnel: Two Research Fellows
  • Funding Agency
    • EPSRC
  • Date From
    • 01/04/96
  • Date To
    • 31/03/99
  • Title
    • Symbolic Verification Systems
  • Funding Agency
    • ESPRIT Keep-in-Touch Programme
  • Date From
    • 01/01/95
  • Date To
    • 31/12/97
  • Title
    • Verification Tools for Distributed Systems
  • Summary
  • Funding Agency
    • Royal Society
  • Date From
    • 01/04/94
  • Date To
    • 31/12/97
  • Title
    • EXPRESS Cooperation Network
  • Funding Agency
    • EU Framework IV
  • Date From
    • 01/10/92
  • Date To
    • 31/12/97
  • Title
    • CONCUR II
  • Summary
    • Personnel: One Research Fellow
  • Funding Agency
    • ESPRIT Basic Research Actions
  • Date From
    • 01/04/92
  • Date To
    • 31/09/95
  • Title
    • Abstraction and Implementation Relations
  • Funding Agency
    • ARC
  • Date From
    • 01/10/92
  • Date To
    • 30/9/95
  • Title
    • Development of Algebraic Methods for Distributed Systems
  • Summary
    • Personnel: Two Research Fellows
  • Funding Agency
    • SERC
  • Date From
    • 01/01/92 -
  • Date To
    • 31/12/94
  • Title
    • Non-interleaving Theories for Concurrent Systems
  • Funding Agency
    • ALLIANCE
  • Date From
    • 01/01/91
  • Date To
    • 31/12/92
  • Title
    • Integration of Behavioural and Algebraic Proof Systems for Concurrent Systems
  • Funding Agency
    • SERC
  • Date From
    • 01/09/91
  • Date To
    • 31/08/92
  • Title
    • CONCUR
  • Funding Agency
    • ESPRIT Basic Research Actions
  • Date From
    • 01/10/89
  • Date To
    • 31/10/91
  • Title
    • CEDISYS
  • Funding Agency
    • ESPRIT Basic Research Actions
  • Date From
    • 01/04/89
  • Date To
    • 30/09/91
  • Title
    • Algebraic Proof Systems for Communicating Processes
  • Funding Agency
    • SERC
  • Date From
    • 01/04/90
  • Date To
    • 31/3/91
  • Title
    • Algebraic Models of Concurrent Systems
  • Funding Agency
    • SERC
  • Date From
    • 01/04/87
  • Date To
    • 31/03/90

Keywords

Computer Programming Languages; Computer Science