Skip to main content

Trinity College Dublin, The University of Dublin

Menu Search



Publications

Publications

Year Authors Title
  2016 Bernardi, G., Hennessy, M. Modelling session types using contracts Mathematical Structures in Computer Science, 26(3), pp510-560. DOI: http://dx.doi.org/10.1017/S0960129514000243
  2015 Bernardi G, Hennessy M Mutually testing processes Logical Methods in Computer Science, 11(2), pp61-75. DOI: http://dx.doi.org/10.1007/978-3-642-40184-8_6
  2015 Cerone, A., Hennessy, M., Merro, M. Modelling Mac-Layer communications in wireless systems Logical Methods in Computer Science, 11(1), pp18. DOI: http://dx.doi.org/10.2168/LMCS-11(1:18)2015
  2014 Vasileios Koutavas and Carlo Spaccasassi and Matthew Hennessy Bisimulations for Communicating Transactions (Extended Abstract) Foundations of Software Science and Computation Structures, 8412, pp320-334. DOI: http://dx.doi.org/10.1007/978-3-642-54830-7_21
  2014 Bernardi G, Hennessy M Compliance and testing preorders differ Lecture Notes in Computer Science (including subseries Lecture Notes in Ar, 8368, pp69-81. DOI: http://dx.doi.org/10.1007/978-3-319-05032-4_6
  2014 Francalanza A, Devries E, Hennessy M Compositional reasoning for explicit resource management in channel-based concurrency Logical Methods in Computer Science, 10(2), pp15. DOI: http://dx.doi.org/10.2168/LMCS-10(2:15)2014
  2014 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, pp387-401. DOI: http://dx.doi.org/10.1007/978-3-662-44584-6_27
  2014 Cerone A, Hennessy M Characterising testing preorders for broadcasting distributed systems Lecture Notes in Computer Science (including subseries Lecture Notes in Ar, 8902, pp67-81. DOI: http://dx.doi.org/10.1007/978-3-662-45917-1 5
  2013 Deng, Y., van Glabbeek, R., Hennessy, M., Morgan, C. Real-reward testing for probabilistic processes Theoretical Computer Science , 538, pp16–36. DOI: http://dx.doi.org/10.1016/j.tcs.2013.07.016
  2013 Cerone, A., Hennessy, M. Modelling probabilistic wireless networks Logical Methods in Computer Science , 9(3). DOI: http://dx.doi.org/10.2168/LMCS-9(3:26)2013
  2013 Cerone, A., Hennessy, M., Merro, M. Modelling MAC-layer communications in wireless systems (extended abstract) 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;, 7890, pp16-30. DOI: http://dx.doi.org/10.1007/978-3-642-38493-6_2
  2013 Koutavas, V., Hennessy, M. Symbolic bisimulation for a higher-order distributed language with passivation (extended abstract) 24th International Conference on Concurrency Theory, CONCUR 2013, 8052, pp167-181. DOI: http://dx.doi.org/10.1007/978-3-642-40184-8_13
  2013 Bernardi, G., Hennessy, M. Mutually testing processes (extended abstract) 24th International Conference on Concurrency Theory, CONCUR 2013, 8052, pp61-75. DOI: http://dx.doi.org/10.1007/978-3-642-40184-8_6
  2013 Deng, Y., Hennessy, M. Compositional reasoning for weighted Markov decision processes Science of Computer Programming . DOI: http://dx.doi.org/10.1016/j.scico.2013.02.009
  2013 Yuxin Deng and Matthew Hennessy. On the Semantics of Markov Automata. Information and Computation, 222, pp139-168. DOI: http://dx.doi.org/10.1016/j.ic.2012.10.010
  2012 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), pp531-556. . DOI: http://dx.doi.org/10.1093/logcom/exs022
  2012 Vasileios Koutavas and Matthew Hennessy First-Order Reasoning for Higher-Order Concurrency. Journal of Computer Languages, Systems and Structures, 38(3), pp242-277. DOI: http://dx.doi.org/10.1016/j.cl.2012.04.003
  2012 Matthew Hennessy Exploring probabilistic bisimulations, part I. Formal Aspects of Computing, 24(4-6), pp749-768. DOI: http://dx.doi.org10.1007/s00165-012-0242-7
  2012 Giovanni Bernardi and Matthew Hennessy. Modelling session types using contracts. ACM Symposium on Applied Computing, 2012, pp1941-1946. DOI: http://dx.doi.org/10.1145/2245276.2232097
  2012 Andrea Cerone and Matthew Hennessy. Modelling Probabilistic Wireless Networks - (Extended Abstract). 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, 7273, pp135-151. DOI: http://dx.doi.org/10.1007/978-3-642-30793-5_9
  2012 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 , pp143-157. DOI: http://dx.doi.org/10.1007/978-3-642-29320-7_10
  2011 Yuxin Deng and Matthew Hennessy. Compositional Reasoning for Markov Decision Processes To be presented at Fundamentals of Software Engineering
  2011 Yuxin Deng and Matthew Hennessy. On the Semantics of Markov Automata The 38th International Colloquium on Automata, Languages and Programming (ICALP11), 6756, pp307-318. DOI: http://dx.doi.org/10.1007/978-3-642-22012-8_24
  2011 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) . DOI: http://dx.doi.org/10.4204/eptcs.57.5
  2011 Vasileios Koutavas and Matthew Hennessy. A Testing Theory for a Higher-Order Cryptographic Language 20th European Symposium on Programming (ESOP'11) . DOI: http://dx.doi.org/10.1007/978-3-642-19718-5_19
  2011 Matthew Hennessy. A calculus for costed computations Logical Methods in Computer Science, pp1-35. DOI: http://dx.doi.org/10.2168/lmcs-7(1:7)2011
  2010 Edsko de Vries, Adrian Francalanza and Matthew Hennessy. Uniqueness Typing for Resource Management in Message-Passing Concurrency. First International Workshop on Linearity (LINEARITY 2009), 22, pp26-37
  2010 Edsko de Vries, Vasileios Koutavas and Matthew Hennessy. Liveness of Communicating Transactions (Extended Abstract) Lecture Notes in Computer Science, 6461, pp392-407. DOI: http://dx.doi.org/10.1007/978-3-642-17164-2_27
  2010 Andrea Cerone and Matthew Hennessy Process Behaviour: Formulae vs. Tests 17th International Workshop on Expressiveness in Concurrency (Express'10) , 41, pp31-45. DOI: http://dx.doi.org/10.4204/EPTCS.41.3
  2010 Edsko de Vries, Vasileios Koutavas and Matthew Hennessy. Communicating Transactions 21st International Conference on Concurrency Theory (CONCUR 2010), 6269(2010), pp569-583. DOI: http://dx.doi.org/10.1007/978-3-642-15375-4_39
  2009 Matthew Hennessy and Manish Gaur. Counting the cost in the picalculus. 1st Interaction and Concurrency Experience (ICE'08), 229(3), pp117-129. DOI: http://dx.doi.org/10.1016/j.entcs.2009.06.042
  2009 Yuxin Deng and Rob van Glabbeek and Matthew Hennessy and Carroll Morgan. Testing Finitary Probabilistic Processes 20th International Conference on Concurrency Theory (CONCUR'09). DOI: http://dx.doi.org/10.1007/978-3-642-04081-8_19
  2008 Yuxin Deng, Matthew Hennessy, Rob J. van Glabbeek, Carroll Morgan Characterising Testing Preorders for Finite Probabilistic Processes . DOI: http://dx.doi.org/10.2168/lmcs-4(4:4)2008
  2008 Francalanza, A, Hennessy, M. A theory of system behaviour in the presence of node and link failure Information and Computation , 206(6), pp711-759. DOI: http://dx.doi.org/10.1016/j.ic.2007.12.002
  2008 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, pp757-777. DOI: http://dx.doi.org/10.1007/978-3-540-68679-8_47
  2007 Yuxin Deng and Rob van Glabbeek and Matthew Hennessy and Carroll Morgan and Chenyi Zhang. Characterising Testing Preorders for Finite Probabilistic Processes 22nd Annual IEEE Symposium on Logic in Computer Science, 171, pp313-325. DOI: http://dx.doi.org/10.1109/LICS.2007.15
  2007 Matthew Hennessy A Distributed Picalculus . DOI: http://dx.doi.org/10.2168/lmcs-4(4:4)2008
  2007 Francalanza, A, Hennessy, M. A theory for observational fault tolerance Journal of Logic and Algebraic Programming, 73(1-2), pp22-50. DOI: http://dx.doi.org/10.1007/11690634_2
  2007 Adrian Francalanza and Matthew Hennessy A Fault Tolerance Bisimulation Proof for Consensus. 16th European Symposium of Lecture Notes in Computer Science, 4421 , pp395-410. DOI: http://dx.doi.org/10.1007/978-3-540-71316-6_27
  2007 Deng, Y. , van Glabbeek, R. , Hennessy, M. , Morgan, C. , Zhang, C. Remarks on Testing Probabilistic Processes Electronic Notes in Theoretical Computer Science , 172, pp359-397 . DOI: http://dx.doi.org/10.1016/j.entcs.2007.02.013
  2007 Hym, S., Hennessy, M. Adding recursion to Dpi Theoretical Computer Science , 373(3), pp182-212 . DOI: http://dx.doi.org/10.1016/j.tcs.2006.12.017
  2007 Francalanza, A, Hennessy, M. A fault tolerance bisimulation proof for consensus Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) , pp395-410 . DOI: http://dx.doi.org/10.1007/978-3-540-71316-6
  2006 Gorla, D., Hennessy, M. , Sassone, V. Inferring dynamic credentials for rôle-based trust management Proceedings of the Eight ACM SIGPLAN Symposium on Principles and Practice of Declarative Programming , pp213-224 . DOI: http://dx.doi.org/10.1145/1140335.1140361
  2006 Merro, M., Hennessy, M. A bisimulation-based semantic theory of Safe Ambients ACM Transactions on Programming Languages and Systems , 28(2), pp290-330 . DOI: http://doi.acm.org/10.1145/1119479.1119482
  2006 Adrian Francalanza and Matthew Hennessy A Theory of System Fault Tolerance Fossacs06 , 3921 , pp16-31
  2006 Francalanza, A. , Hennessy, M. A theory for observational fault tolerance Lecture Notes in Computer Science , pp 16-31 . DOI: http://dx.doi.org/10.1007/11690634
  2005 Hennessy, M., Rathke, J., Yoshida, N. SAFEDPI: A language for controlling mobile code Acta Informatica , 42(4-5), pp227-290. DOI: http://dx.doi.org/10.1007/s00236-005-0178-y
  2005 Hennessy, Matthew. The Security Picalculus and Non-interference. Journal of Logic and Algebraic Programming, 63(1), pp3-34. DOI: http://dx.doi.org/10.1016/j.jlap.2004.01.003
  2005 Alberto Ciaffaglione, Matthew Hennessy and Julian Rathke Proof methodologies for behavioural equivalence in DPI Lecture Notes in Computer Science , pp335-350 . DOI: http://dx.doi.org/10.1007/11562436
  2005 Adrian Francalanza and Matthew Hennessy. A Theory of System Behaviour in the Presence of Node and Link Failures CONCUR 05, pp368-382. DOI: http://dx.doi.org/10.1007/11539452_29

Page: 1 of 3  Records: 148
Page 1 2 3