Travelled to:1 × Austria
1 × Denmark
1 × France
1 × Israel
1 × Portugal
2 × Germany
2 × Greece
2 × Poland
2 × Switzerland
3 × Italy
3 × Spain
3 × United Kingdom
8 × USA
Collaborated with:J.Riely ∅ A.Francalanza L.Aceto R.D.Nicola E.A.Ashcroft Y.Deng V.Koutavas N.Yoshida M.Merro J.Rathke G.Bernardi C.Hartonas X.Liu A.Ingólfsdóttir R.Cleaveland R.Milner R.J.v.Glabbeek C.Morgan C.Spaccasassi D.Gorla V.Sassone W.Ferreira A.Jeffrey C.Zhang
Talks about:process (15) theori (6) pass (5) languag (4) bisimul (4) algebra (4) mobil (4) type (4) test (4) nondetermin (3)
Person: Matthew Hennessy
DBLP: Hennessy:Matthew
Facilitated 1 volumes:
EdContributed to:
2014
2012
20112011
20112007
20072006
200620042003
200220002000
199919991998
19971997
19961994
199319911990198919881985
19841983198019771976
1987Wrote 33 papers:
- FoSSaCS-2014-KoutavasSH #bisimulation #communication #transaction
- Bisimulations for Communicating Transactions — (VK, CS, MH), pp. 320–334.
- SAC-2012-BernardiH #contract #modelling #using
- Modelling session types using contracts (GB, MH), pp. 1941–1946.
- ESOP-2011-KoutavasH #encryption #higher-order #testing
- A Testing Theory for a Higher-Order Cryptographic Language — (VK, MH), pp. 358–377.
- ICALP-v2-2011-DengH #automaton #markov #on the #semantics
- On the Semantics of Markov Automata (YD, MH), pp. 307–318.
- QAPL-2011-DengGHM #probability #process #testing
- Real-Reward Testing for Probabilistic Processes (YD, RJvG, MH, CM), pp. 61–73.
- ESOP-2007-FrancalanzaH #bisimulation #fault tolerance #proving
- A Fault Tolerance Bisimulation Proof for Consensus (AF, MH), pp. 395–410.
- LICS-2007-DengGHMZ #finite #probability #process #testing
- Characterising Testing Preorders for Finite Probabilistic Processes (YD, RJvG, MH, CM, CZ), pp. 313–325.
- FoSSaCS-2006-FrancalanzaH #fault tolerance
- A Theory for Observational Fault Tolerance (AF, MH), pp. 16–31.
- PPDP-2006-GorlaHS #trust
- Inferring dynamic credentials for rôle-based trust management (DG, MH, VS), pp. 213–224.
- FoSSaCS-2004-HennessyRY #mobile #named
- safeDpi: A Language for Controlling Mobile Code (MH, JR, NY), pp. 241–256.
- FoSSaCS-2003-HennessyMR #behaviour #distributed #towards
- Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems (MH, MM, JR), pp. 282–298.
- POPL-2002-MerroH #bisimulation
- Bisimulation congruences in safe ambients (MM, MH), pp. 71–80.
- ICALP-2000-HennessyR #data flow #resource management #π-calculus
- Information Flow vs. Resource Access in the Asynchronous π-Calculus (MH, JR), pp. 415–427.
- LICS-2000-YoshidaH #process
- Assigning Types to Processes (NY, MH), pp. 334–345.
- IFM-1999-Hennessy #calculus #message passing #process #proving
- Proof Systems for Message-Passing Process Calculi (MH), p. 26.
- POPL-1999-RielyH #mobile #trust #type system
- Trust and Partial Typing in Open Systems of Mobile Agents (JR, MH), pp. 93–104.
- POPL-1998-RielyH #distributed #mobile #process
- A Typed Language for Distributed Mobile Processes (JR, MH), pp. 378–390.
- CSL-1997-HartonasH #concurrent #functional #higher-order
- Full Abstractness for a Functional/Concurrent Language with Higher-Order Value-Passing (CH, MH), pp. 239–254.
- ICALP-1997-RielyH #distributed #process
- Distributed Processes and Location Failures (JR, MH), pp. 471–481.
- ICFP-1996-FerreiraHJ #bisimulation #formal method
- A Theory of Weak Bisimulation for Core CML (WF, MH, AJ), pp. 201–212.
- ICALP-1994-Hennessy #higher-order #modelling #process
- Higher-Order Process and Their Models (MH), pp. 286–303.
- CAV-1993-HennessyL #logic #message passing #process
- A Modal Logic for Message passing Processes (MH, XL), pp. 359–370.
- ICALP-1991-AcetoH #algebra #finite #process #refinement
- Adding Action Refinement to a Finite Process Algebra (LA, MH), pp. 506–519.
- ICALP-1990-HennessyI #communication #formal method #process
- A Theory of Communicating Processes with Value-Passing (MH, AI), pp. 209–219.
- LICS-1989-AcetoH #algebra #process #towards
- Towards Action-Refinement in Process Algebras (LA, MH), pp. 138–145.
- LICS-1988-CleavelandH #algebra #process
- Priorities in Process Algebras (RC, MH), pp. 193–202.
- ICALP-1985-Hennessy #algebra #communication #process
- An Algebraic Theory of Fair Asynchronous Communicating Processes (MH), pp. 260–269.
- STOC-1984-Hennessy #modelling #process
- Modelling Fair Processes (MH), pp. 25–30.
- ICALP-1983-NicolaH #equivalence #process #testing
- Testing Equivalence for Processes (RDN, MH), pp. 548–560.
- ICALP-1980-HennessyM #concurrent #nondeterminism #on the
- On Observing Nondeterminism and Concurrency (MH, RM), pp. 299–309.
- STOC-1977-HennessyA #nondeterminism
- Parameter-Passing Mechanisms and Nondeterminism (MH, EAA), pp. 306–311.
- ICALP-1976-HennessyA #nondeterminism #semantics
- The Semantics of Nondeterminism (MH, EAA), pp. 478–493.
- CAAP-1987-NicolaH
- CCS without tau's (RDN, MH), pp. 138–152.