dblp.uni-trier.dewww.uni-trier.de

Matthew Hennessy Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
126EEYuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan: Testing Finitary Probabilistic Processes. CONCUR 2009: 274-288
125EEMatthew Hennessy: Distributed Systems and Their Environments. TAMC 2009: 4-5
2008
124EEGé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
123EEYuxin Deng, Matthew Hennessy, Rob J. van Glabbeek, Carroll Morgan: Characterising Testing Preorders for Finite Probabilistic Processes CoRR abs/0810.3708: (2008)
122EEAdrian Francalanza, Matthew Hennessy: A theory of system behaviour in the presence of node and link failure. Inf. Comput. 206(6): 711-759 (2008)
121EEYuxin 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
120EEAdrian Francalanza, Matthew Hennessy: A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract). ESOP 2007: 395-410
119EEYuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan, Chenyi Zhang: Characterising Testing Preorders for Finite Probabilistic Processes. LICS 2007: 313-325
118EEYuxin 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)
117EERob J. van Glabbeek, Matthew Hennessy: Preface. Electr. Notes Theor. Comput. Sci. 192(1): 1-3 (2007)
116EEAdrian Francalanza, Matthew Hennessy: A theory for observational fault tolerance. J. Log. Algebr. Program. 73(1-2): 22-50 (2007)
115EESamuel Hym, Matthew Hennessy: Adding recursion to Dpi. Theor. Comput. Sci. 373(3): 182-212 (2007)
2006
114EEAdrian Francalanza, Matthew Hennessy: A Theory for Observational Fault Tolerance. FoSSaCS 2006: 16-31
113EEDaniele Gorla, Matthew Hennessy, Vladimiro Sassone: Inferring dynamic credentials for rôle-based trust management. PPDP 2006: 213-224
112EEMassimo Merro, Matthew Hennessy: A bisimulation-based semantic theory of Safe Ambients. ACM Trans. Program. Lang. Syst. 28(2): 290-330 (2006)
111EESamuel Hym, Matthew Hennessy: Adding Recursion to Dpi: (Extended Abstract). Electr. Notes Theor. Comput. Sci. 156(1): 115-133 (2006)
2005
110EEAdrian Francalanza, Matthew Hennessy: A Theory of System Behaviour in the Presence of Node and Link Failures. CONCUR 2005: 368-382
109EEAlberto Ciaffaglione, Matthew Hennessy, Julian Rathke: Proof Methodologies for Behavioural Equivalence in DPI. FORTE 2005: 335-350
108EEMatthew Hennessy, Julian Rathke, Nobuko Yoshida: safeDpi: a language for controlling mobile code. Acta Inf. 42(4-5): 227-290 (2005)
107EEDaniele Gorla, Matthew Hennessy, Vladimiro Sassone: Security Policies as Membranes in Systems for Global Computing CoRR abs/cs/0506061: (2005)
106EEDaniele Gorla, Matthew Hennessy, Vladimiro Sassone: Security Policies as Membranes in Systems for Global Computing. Electr. Notes Theor. Comput. Sci. 138(1): 23-42 (2005)
105EEMatthew Hennessy: The security pi-calculus and non-interference. J. Log. Algebr. Program. 63(1): 3-34 (2005)
104EEDaniele Gorla, Matthew Hennessy, Vladimiro Sassone: Security Policies as Membranes in Systems for Global Computing. Logical Methods in Computer Science 1(3): (2005)
2004
103EEMatthew Hennessy, Julian Rathke, Nobuko Yoshida: safeDpi: A Language for Controlling Mobile Code. FoSSaCS 2004: 241-256
102EEMatthew Hennessy, Julian Rathke: Typed behavioural equivalences for processes in the presence of subtyping. Mathematical Structures in Computer Science 14(5): 651-684 (2004)
101EEStephan Eidenbenz, Matthew Hennessy, Rafael Morales Bueno, Francisco Triguero Ruiz, Peter Widmayer, Ricardo Conejo: Preface. Theor. Comput. Sci. 312(1): 1-2 (2004)
100EEMatthew 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
99EEMatthew Hennessy, Massimo Merro, Julian Rathke: Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems. FoSSaCS 2003: 282-298
98EEJames Riely, Matthew Hennessy: Trust and Partial Typing in Open Systems of Mobile Agents. J. Autom. Reasoning 31(3-4): 335-370 (2003)
2002
97 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
96EEMassimo Merro, Matthew Hennessy: Bisimulation congruences in safe ambients. POPL 2002: 71-80
95EEMatthew Hennessy, James Riely: Information flow vs. resource access in the asynchronous pi-calculus. ACM Trans. Program. Lang. Syst. 24(5): 566-591 (2002)
94EEMatthew Hennessy, Julian Rathke: Typed behavioural equivalences for processes in the presence of subtyping. Electr. Notes Theor. Comput. Sci. 61: (2002)
93EEMatthew Hennessy, James Riely: Resource Access Control in Systems of Mobile Agents. Inf. Comput. 173(1): 82-120 (2002)
92EENobuko Yoshida, Matthew Hennessy: Assigning Types to Processes. Inf. Comput. 174(2): 143-179 (2002)
91EEMatthew Hennessy: A fully abstract denotational semantics for the pi-calculus. Theor. Comput. Sci. 278(1-2): 53-89 (2002)
2001
90 Matthew Hennessy, H. Lin, Julian Rathke: Unique fixpoint induction for message-passing process calculi. Sci. Comput. Program. 41(3): 241-275 (2001)
89EEJames Riely, Matthew Hennessy: Distributed processes and location failures. Theor. Comput. Sci. 266(1-2): 693-735 (2001)
2000
88EEMatthew Hennessy, James Riely: Information Flow vs. Resource Access in the Asynchronous Pi-Calculus. ICALP 2000: 415-427
87EENobuko Yoshida, Matthew Hennessy: Assigning Types to Processes. LICS 2000: 334-345
86 William Ferreira, Matthew Hennessy, Alan Jeffrey: Combining the typed lambda-calculus with CCS. Proof, Language, and Interaction 2000: 511-534
1999
85EENobuko Yoshida, Matthew Hennessy: Suptyping and Locality in Distributed Higher Order Processes (extended abstract). CONCUR 1999: 557-572
84EEMatthew Hennessy: Axiomatising Asynchronous Process Calculi (abstract). FCT 1999: 90
83 Matthew Hennessy: Proof Systems for Message-Passing Process Calculi. IFM 1999: 26
82EEJames Riely, Matthew Hennessy: Trust and Partial Typing in Open Systems of Mobile Agents. POPL 1999: 93-104
81 Matthew Hennessy, James Riely: Type-Safe Execution of Mobile Agents in Anonymous Networks. Secure Internet Programming 1999: 95-115
80EEWilliam Ferreira, Matthew Hennessy: A Behavioural Theory of First-Order CML. Theor. Comput. Sci. 216(1-2): 55-107 (1999)
1998
79EEMatthew Hennessy, James Riely: Type-Safe Execution of Mobile Agents in Anonymous Networks. ECOOP Workshops 1998: 304
78EEIlaria Castellani, Matthew Hennessy: Testing Theories for Asynchronous Languages. FSTTCS 1998: 90-101
77EEJames Riely, Matthew Hennessy: A Typed Language for Distributed Mobile Processes (Extended Abstract). POPL 1998: 378-390
76EEMatthew Hennessy: A survey of location calculi. Electr. Notes Theor. Comput. Sci. 16(2): (1998)
75EEMatthew Hennessy, James Riely: Resource Access Control in Systems of Mobile Agents. Electr. Notes Theor. Comput. Sci. 16(3): (1998)
74 Chrysafis Hartonas, Matthew Hennessy: Full Abstractness for a Functional/Concurrent Language with Higher-Order Value-Passing. Inf. Comput. 145(1): 64-106 (1998)
73 William Ferreira, Matthew Hennessy, Alan Jeffrey: A Theory of Weak Bisimulation for Core CML. J. Funct. Program. 8(5): 447-491 (1998)
72EEMatthew Hennessy, Julian Rathke: Bisimulations for a Calculus of Broadcasting Systems. Theor. Comput. Sci. 200(1-2): 225-260 (1998)
1997
71EEChrysafis Hartonas, Matthew Hennessy: Full Abstractness for a Functional/Concurrent Language with Higher-Order Value-Passing (Extended Abstract). CSL 1997: 239-254
70EEJames Riely, Matthew Hennessy: Distributed Processes and Location Failures (Extended Abstract). ICALP 1997: 471-481
69 Julian Rathke, Matthew Hennessy: Local Model Checking for Value-Passing Processes (Extended Abstract). TACS 1997: 250-266
68 Astrid Kiehn, Matthew Hennessy: On the Decidability of Non-Interleaving Process Equivalences. Fundam. Inform. 30(1): 11-30 (1997)
1996
67 William Ferreira, Matthew Hennessy, Alan Jeffrey: A Theory of Weak Bisimulation for Core CML. ICFP 1996: 201-212
66 Matthew Hennessy, H. Lin: Proof Systems for Message-Passing Process Algebras. Formal Asp. Comput. 8(4): 379-407 (1996)
1995
65EEMatthew Hennessy, Julian Rathke: Bisimulations for a Calculus of Broadcasting Systems. CONCUR 1995: 486-500
64EEWilliam Ferreira, Matthew Hennessy: Towards a Semantic Theory of CML (Extended Abstract). MFCS 1995: 454-466
63 Matthew Hennessy, Xinxin Liu: A Modal Logic for Message Passing Processes Acta Inf. 32(4): 375-393 (1995)
62 Matthew Hennessy: Concurrent Testing of Processes Acta Inf. 32(6): 509-543 (1995)
61 Matthew Hennessy, Tim Regan: A Process Algebra for Timed Systems Inf. Comput. 117(2): 221-239 (1995)
60EEMatthew Hennessy, H. Lin: Symbolic Bisimulations. Theor. Comput. Sci. 138(2): 353-389 (1995)
1994
59EEMatthew Hennessy: Higher-Order Process and Their Models. ICALP 1994: 286-303
58 Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn: A Theory of Processes with Localities. Formal Asp. Comput. 6(2): 165-200 (1994)
57 Matthew Hennessy: A Fully Abstract Denotational Model for Higher-Order Processes Inf. Comput. 112(1): 55-95 (1994)
56 Luca Aceto, Matthew Hennessy: Adding Action Refinement to a Finite Process Algebra Inf. Comput. 115(2): 179-247 (1994)
1993
55EEMatthew Hennessy, Xinxin Liu: A Modal Logic for Message passing Processes (Extended Abstract). CAV 1993: 359-370
54EEMatthew Hennessy, H. Lin: Proof Systems for Message-Passing Process Algebras. CONCUR 1993: 202-216
53 Matthew Hennessy: A Fully Abstract Denotational Model for Higher-Order Processes (Extended Abstract) LICS 1993: 397-408
52EEMatthew Hennessy: Symbolic Bisimulations (Abstract). MFCS 1993: 83
51 Rance Cleaveland, Matthew Hennessy: Testing Equivalence as a Bisimulation Equivalence. Formal Asp. Comput. 5(1): 1-20 (1993)
50 Matthew Hennessy, Anna Ingólfsdóttir: Communicating Processes with Value-passing and Assignments. Formal Asp. Comput. 5(5): 432-466 (1993)
49 Luca Aceto, Matthew Hennessy: Towards Action-Refinement in Process Algebras Inf. Comput. 103(2): 204-269 (1993)
48 Matthew Hennessy, Anna Ingólfsdóttir: A Theory of Communicating Processes with Value Passing Inf. Comput. 107(2): 202-236 (1993)
47 Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn: Observing Localities. Theor. Comput. Sci. 114(1): 31-61 (1993)
1992
46EEGérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn: A Theory of Process with Localities (Extended Abstract). CONCUR 1992: 108-122
45EEMatthew Hennessy: Concurrent Testing of Processes (Extended Abstract). CONCUR 1992: 94-107
44 S. Arun-Kumar, Matthew Hennessy: An Efficiency Preorder for Processes. Acta Inf. 29(8): 737-760 (1992)
43EELuca Aceto, Matthew Hennessy: Termination, Deadlock, and Divergence. J. ACM 39(1): 147-187 (1992)
1991
42EELuca Aceto, Matthew Hennessy: Adding Action Refinement to a Finite Process Algebra. ICALP 1991: 506-519
41EEGérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn: Observing Localities (Extended Abstract). MFCS 1991: 93-102
40 S. Arun-Kumar, Matthew Hennessy: An Efficiency Preorder for Processes. TACS 1991: 152-175
39 Matthew Hennessy: A Proof Sustem for Communicating Processes with Value-Passing. Formal Asp. Comput. 3(4): 346-366 (1991)
1990
38EEMatthew Hennessy: Value-Passing in Process Algebras (Abstract). CONCUR 1990: 31
37 Matthew Hennessy, Tim Regan: A Temporal Process Algebra. FORTE 1990: 33-48
36EEMatthew Hennessy, Anna Ingólfsdóttir: A Theory of Communicating Processes with Value-Passing. ICALP 1990: 209-219
35 Rance Cleaveland, Matthew Hennessy: Priorities in Process Algebras Inf. Comput. 87(1/2): 58-77 (1990)
1989
34EERance Cleaveland, Matthew Hennessy: Testing Equivalence as a Bisimulation Equivalence. Automatic Verification Methods for Finite State Systems 1989: 11-23
33EEMatthew Hennessy: A Proof System for Communicating Processes with Value-passing (Extended Abstract). FSTTCS 1989: 325-339
32 Luca Aceto, Matthew Hennessy: Towards Action-Refinement in Process Algebras LICS 1989: 138-145
31EELuca Aceto, Matthew Hennessy: Termination, Deadlock and Divergence. Mathematical Foundations of Programming Semantics 1989: 301-318
30EEIlaria Castellani, Matthew Hennessy: Distributed bisimulations. J. ACM 36(4): 887-911 (1989)
1988
29 Rance Cleaveland, Matthew Hennessy: Priorities in Process Algebras LICS 1988: 193-202
28EEMatthew Hennessy: Observing processes. REX Workshop 1988: 173-200
27 Matthew Hennessy: Axiomatising Finite Concurrent Processes. SIAM J. Comput. 17(5): 997-1017 (1988)
1987
26EERocco 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
24EEMatthew Hennessy: Communication Primitives in Programming and Specification Languages. Networking in Open Systems 1986: 223-251
23EEMatthew Hennessy: Proving Systolic Systems Correct. ACM Trans. Program. Lang. Syst. 8(3): 344-387 (1986)
1985
22EEMatthew 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)
20EEMatthew Hennessy, Robin Milner: Algebraic Laws for Nondeterminism and Concurrency J. ACM 32(1): 137-161 (1985)
19EEMatthew Hennessy: Acceptance Trees J. ACM 32(4): 896-928 (1985)
1984
18EEMatthew 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
14EERocco 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
8EEMatthew Hennessy, Robin Milner: On Observing Nondeterminism and Concurrency. ICALP 1980: 299-309
7EEMatthew 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
3EEMatthew 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

1Luca Aceto [31] [32] [42] [43] [49] [56]
2S. Arun-Kumar [40] [44]
3Edward A. Ashcroft [1] [2] [4]
4Gérard Boudol [41] [46] [47] [58] [124]
5Rafael Morales Bueno [97] [101]
6Ilaria Castellani [30] [41] [46] [47] [58] [78] [124]
7Alberto Ciaffaglione [109]
8Rance Cleaveland [29] [34] [35] [51]
9Ricardo Conejo [97] [101]
10Yuxin Deng [118] [119] [121] [123] [126]
11Stephan Eidenbenz [97] [101]
12William Ferreira [64] [67] [73] [80] [86]
13Adrian Francalanza [110] [114] [116] [120] [122]
14Rob J. van Glabbeek [117] [118] [119] [121] [123] [126]
15Daniele Gorla [104] [106] [107] [113]
16Chrysafis Hartonas [71] [74]
17Samuel Hym [111] [115]
18Anna Ingólfsdóttir [36] [48] [50]
19Alan Jeffrey [67] [73] [86]
20Astrid Kiehn [41] [46] [47] [58] [68]
21W. Li [10]
22H. Lin [54] [60] [66] [90]
23Xinxin Liu [55] [63]
24Massimo Merro [96] [99] [100] [112]
25Robin Milner [8] [20]
26Carroll Morgan [118] [119] [121] [123] [126]
27Rocco De Nicola [14] [15] [26]
28Mogens Nielsen [124]
29Gordon D. Plotkin [3] [7] [10]
30Julian Rathke [65] [69] [72] [90] [94] [99] [100] [102] [103] [108] [109]
31Tim Regan [37] [61]
32James Riely [70] [75] [77] [79] [81] [82] [88] [89] [93] [95] [98]
33Francisco Triguero Ruiz [97] [101]
34Vladimiro Sassone [104] [106] [107] [113]
35Colin Stirling [18] [21]
36Peter Widmayer [97] [101]
37Glynn Winskel [124]
38Nobuko Yoshida [85] [87] [92] [103] [108]
39Chenyi Zhang [118] [119]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)