2008 | ||
---|---|---|
123 | EE | 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 |
122 | EE | Yuxin Deng, Matthew Hennessy, Rob J. van Glabbeek, Carroll Morgan: Characterising Testing Preorders for Finite Probabilistic Processes CoRR abs/0810.3708: (2008) |
121 | EE | Adrian Francalanza, Matthew Hennessy: A theory of system behaviour in the presence of node and link failure. Inf. Comput. 206(6): 711-759 (2008) |
2007 | ||
120 | EE | Adrian Francalanza, Matthew Hennessy: A Fault Tolerance Bisimulation Proof for Consensus (Extended Abstract). ESOP 2007: 395-410 |
119 | EE | Yuxin Deng, Rob J. van Glabbeek, Matthew Hennessy, Carroll Morgan, Chenyi Zhang: Characterising Testing Preorders for Finite Probabilistic Processes. LICS 2007: 313-325 |
118 | EE | 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) |
117 | EE | Rob J. van Glabbeek, Matthew Hennessy: Preface. Electr. Notes Theor. Comput. Sci. 192(1): 1-3 (2007) |
116 | EE | Adrian Francalanza, Matthew Hennessy: A theory for observational fault tolerance. J. Log. Algebr. Program. 73(1-2): 22-50 (2007) |
115 | EE | Samuel Hym, Matthew Hennessy: Adding recursion to Dpi. Theor. Comput. Sci. 373(3): 182-212 (2007) |
2006 | ||
114 | EE | Adrian Francalanza, Matthew Hennessy: A Theory for Observational Fault Tolerance. FoSSaCS 2006: 16-31 |
113 | EE | Daniele Gorla, Matthew Hennessy, Vladimiro Sassone: Inferring dynamic credentials for rôle-based trust management. PPDP 2006: 213-224 |
112 | EE | Massimo Merro, Matthew Hennessy: A bisimulation-based semantic theory of Safe Ambients. ACM Trans. Program. Lang. Syst. 28(2): 290-330 (2006) |
111 | EE | Samuel Hym, Matthew Hennessy: Adding Recursion to Dpi: (Extended Abstract). Electr. Notes Theor. Comput. Sci. 156(1): 115-133 (2006) |
2005 | ||
110 | EE | Adrian Francalanza, Matthew Hennessy: A Theory of System Behaviour in the Presence of Node and Link Failures. CONCUR 2005: 368-382 |
109 | EE | Alberto Ciaffaglione, Matthew Hennessy, Julian Rathke: Proof Methodologies for Behavioural Equivalence in DPI. FORTE 2005: 335-350 |
108 | EE | Matthew Hennessy, Julian Rathke, Nobuko Yoshida: safeDpi: a language for controlling mobile code. Acta Inf. 42(4-5): 227-290 (2005) |
107 | EE | Daniele Gorla, Matthew Hennessy, Vladimiro Sassone: Security Policies as Membranes in Systems for Global Computing CoRR abs/cs/0506061: (2005) |
106 | EE | 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) |
105 | EE | Matthew Hennessy: The security pi-calculus and non-interference. J. Log. Algebr. Program. 63(1): 3-34 (2005) |
104 | EE | Daniele Gorla, Matthew Hennessy, Vladimiro Sassone: Security Policies as Membranes in Systems for Global Computing. Logical Methods in Computer Science 1(3): (2005) |
2004 | ||
103 | EE | Matthew Hennessy, Julian Rathke, Nobuko Yoshida: safeDpi: A Language for Controlling Mobile Code. FoSSaCS 2004: 241-256 |
102 | EE | Matthew Hennessy, Julian Rathke: Typed behavioural equivalences for processes in the presence of subtyping. Mathematical Structures in Computer Science 14(5): 651-684 (2004) |
101 | EE | Stephan Eidenbenz, Matthew Hennessy, Rafael Morales Bueno, Francisco Triguero Ruiz, Peter Widmayer, Ricardo Conejo: Preface. Theor. Comput. Sci. 312(1): 1-2 (2004) |
100 | EE | 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 | ||
99 | EE | Matthew Hennessy, Massimo Merro, Julian Rathke: Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems. FoSSaCS 2003: 282-298 |
98 | EE | James 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 | |
96 | EE | Massimo Merro, Matthew Hennessy: Bisimulation congruences in safe ambients. POPL 2002: 71-80 |
95 | EE | Matthew Hennessy, James Riely: Information flow vs. resource access in the asynchronous pi-calculus. ACM Trans. Program. Lang. Syst. 24(5): 566-591 (2002) |
94 | EE | Matthew Hennessy, Julian Rathke: Typed behavioural equivalences for processes in the presence of subtyping. Electr. Notes Theor. Comput. Sci. 61: (2002) |
93 | EE | Matthew Hennessy, James Riely: Resource Access Control in Systems of Mobile Agents. Inf. Comput. 173(1): 82-120 (2002) |
92 | EE | Nobuko Yoshida, Matthew Hennessy: Assigning Types to Processes. Inf. Comput. 174(2): 143-179 (2002) |
91 | EE | Matthew 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) | |
89 | EE | James Riely, Matthew Hennessy: Distributed processes and location failures. Theor. Comput. Sci. 266(1-2): 693-735 (2001) |
2000 | ||
88 | EE | Matthew Hennessy, James Riely: Information Flow vs. Resource Access in the Asynchronous Pi-Calculus. ICALP 2000: 415-427 |
87 | EE | Nobuko 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 | ||
85 | EE | Nobuko Yoshida, Matthew Hennessy: Suptyping and Locality in Distributed Higher Order Processes (extended abstract). CONCUR 1999: 557-572 |
84 | EE | Matthew Hennessy: Axiomatising Asynchronous Process Calculi (abstract). FCT 1999: 90 |
83 | Matthew Hennessy: Proof Systems for Message-Passing Process Calculi. IFM 1999: 26 | |
82 | EE | James 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 | |
80 | EE | William Ferreira, Matthew Hennessy: A Behavioural Theory of First-Order CML. Theor. Comput. Sci. 216(1-2): 55-107 (1999) |
1998 | ||
79 | EE | Matthew Hennessy, James Riely: Type-Safe Execution of Mobile Agents in Anonymous Networks. ECOOP Workshops 1998: 304 |
78 | Ilaria Castellani, Matthew Hennessy: Testing Theories for Asynchronous Languages. FSTTCS 1998: 90-101 | |
77 | EE | James Riely, Matthew Hennessy: A Typed Language for Distributed Mobile Processes (Extended Abstract). POPL 1998: 378-390 |
76 | EE | Matthew Hennessy: A survey of location calculi. Electr. Notes Theor. Comput. Sci. 16(2): (1998) |
75 | EE | Matthew 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) | |
72 | EE | Matthew Hennessy, Julian Rathke: Bisimulations for a Calculus of Broadcasting Systems. Theor. Comput. Sci. 200(1-2): 225-260 (1998) |
1997 | ||
71 | Chrysafis Hartonas, Matthew Hennessy: Full Abstractness for a Functional/Concurrent Language with Higher-Order Value-Passing (Extended Abstract). CSL 1997: 239-254 | |
70 | James 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 | ||
65 | Matthew Hennessy, Julian Rathke: Bisimulations for a Calculus of Broadcasting Systems. CONCUR 1995: 486-500 | |
64 | William 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) | |
60 | EE | Matthew Hennessy, H. Lin: Symbolic Bisimulations. Theor. Comput. Sci. 138(2): 353-389 (1995) |
1994 | ||
59 | Matthew 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 | ||
55 | Matthew Hennessy, Xinxin Liu: A Modal Logic for Message passing Processes (Extended Abstract). CAV 1993: 359-370 | |
54 | Matthew 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 | |
52 | Matthew 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 | ||
46 | Gérard Boudol, Ilaria Castellani, Matthew Hennessy, Astrid Kiehn: A Theory of Process with Localities (Extended Abstract). CONCUR 1992: 108-122 | |
45 | Matthew 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) | |
43 | EE | Luca Aceto, Matthew Hennessy: Termination, Deadlock, and Divergence. J. ACM 39(1): 147-187 (1992) |
1991 | ||
42 | Luca Aceto, Matthew Hennessy: Adding Action Refinement to a Finite Process Algebra. ICALP 1991: 506-519 | |
41 | Gé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 | ||
38 | Matthew Hennessy: Value-Passing in Process Algebras (Abstract). CONCUR 1990: 31 | |
37 | Matthew Hennessy, Tim Regan: A Temporal Process Algebra. FORTE 1990: 33-48 | |
36 | Matthew 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 | ||
34 | Rance Cleaveland, Matthew Hennessy: Testing Equivalence as a Bisimulation Equivalence. Automatic Verification Methods for Finite State Systems 1989: 11-23 | |
33 | Matthew 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 | |
31 | Luca Aceto, Matthew Hennessy: Termination, Deadlock and Divergence. Mathematical Foundations of Programming Semantics 1989: 301-318 | |
30 | EE | Ilaria 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 | |
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 | EE | 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 | EE | Matthew Hennessy, Robin Milner: Algebraic Laws for Nondeterminism and Concurrency J. ACM 32(1): 137-161 (1985) |
19 | EE | 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 |