Matthew Hennessy

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

Coauthor Index

1	Luca Aceto	[32] [33] [44] [45] [51] [58]
2	S. Arun-Kumar	[42] [46]
3	Edward A. Ashcroft	[1] [2] [4]
4	Gérard Boudol	[43] [48] [49] [60] [129]
5	Rafael Morales Bueno	[101] [105]
6	Ilaria Castellani	[31] [43] [48] [49] [60] [82] [129]
7	Andrea Cerone	[135]
8	Alberto Ciaffaglione	[113]
9	Rance Cleaveland	[29] [35] [36] [53]
10	Ricardo Conejo	[101] [105]
11	Pierre-Louis Curien	[77]
12	Yuxin Deng	[122] [123] [126] [128] [134] [139] [140] [141]
13	Stephan Eidenbenz	[101] [105]
14	William Ferreira	[66] [69] [75] [84] [90]
15	Adrian Francalanza	[114] [118] [120] [124] [127] [133]
16	Manish Gaur	[131]
17	Rob J. van Glabbeek	[121] [122] [123] [126] [128] [134] [139]
18	Daniele Gorla	[108] [110] [111] [117]
19	Chrysafis Hartonas	[73] [78]
20	Samuel Hym	[115] [119]
21	Anna Ingólfsdóttir	[37] [50] [52]
22	Alan Jeffrey	[69] [75] [90]
23	Astrid Kiehn	[43] [48] [49] [60] [70]
24	Bartek Klin	[130]
25	Vasileios Koutavas	[136] [137] [142]
26	W. Li	[10]
27	Huimin Lin	[56] [62] [68] [77] [94]
28	Xinxin Liu	[57] [65]
29	Massimo Merro	[100] [103] [104] [116]
30	Robin Milner	[8] [20]
31	Carroll Morgan (Carroll C. Morgan)	[122] [123] [126] [128] [134] [139]
32	Rocco De Nicola	[14] [15] [26]
33	Mogens Nielsen	[129]
34	Gordon D. Plotkin	[3] [7] [10]
35	Julian Rathke	[67] [71] [74] [94] [98] [103] [104] [106] [107] [112] [113]
36	Tim Regan	[38] [63]
37	James Riely	[72] [79] [81] [83] [85] [86] [92] [93] [97] [99] [102]
38	Francisco Triguero Ruiz	[101] [105]
39	Vladimiro Sassone	[108] [110] [111] [117]
40	Colin Stirling	[18] [21]
41	Edsko de Vries	[133] [136] [137]
42	Peter Widmayer	[101] [105]
43	Glynn Winskel	[129]
44	Nobuko Yoshida	[89] [91] [96] [107] [112]
45	Chenyi Zhang	[122] [123]

Colors in the list of coauthors

Last update Sat Jun 2 20:57:36 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page