The University of Sussex

To see a report abstract, click on its number. Most recently published reports are available for download. If you have queries concerning these or any other publications of the School of Informatics, please contact the School Office.

(2006:01) David Teller: OpenBerg e-book reader. Design and rationale

(2005:07) Rohit Chadha, Damiano Macedonio, Vladimiro Sassone: A hybrid intuitionistic logic: semantics and decidability

(2005:06) Samuel Hym, Matthew Hennessy: Adding recursion to Dpi

(2005:05) Jan Schwinghammer: A typed semantics for languages with higher-order store and subtyping

(2005:04) David Teller: A pi-calculus with limited resources, garbage-collection and guarantees

(2005:03) Alberto Ciaffaglione, Matthew Hennessy, Julian Rathke: Proof methodologies for behavioural equivalence in distributed pi-calculus

(2005:02) Giovanni Conforti, Damiano Macedonio, Vladimiro Sassone: BiLog: spatial logics for bigraphs

(2005:01) Adrian Francalanza , Matthew Hennessy: Location and link failure in a distributed pi-calculus

(2004:04) Rohit Chadha, Damiano Macedonio, Vladimiro Sassone: A distributed Kripke semantics

(2004:03) Bernhard Reus, Jan Schwinghammer: Denotational semantics for Abadi and Leino's logic of objects

(2004:02) Daniele Gorla, Matthew Hennessy, Vladimiro Sassone: Security policies as membranes in systems for global computing

(2004:01) Tim Owen, Ian Wakeman, Julian Rathke: JPolicy: a Java extension for dynamic access control

(2003:02) Matthew Hennessy, Julian Rathke, Nobuko Yoshida: SafeDpi: a language for controlling mobile code

(2003:01) Massimo Merro, Francesco Zappa Nardelli: Bisimulation proof methods for mobile ambients

(2002:04) Alan Jeffrey, Julian Rathke: Contextual equivalence for higher-order pi-calculus revisited

(2002:03) Alan Jeffrey, Julian Rathke: A fully abstract may testing semantics for concurrent objects

(2002:02) Alan Jeffrey, Julian Rathke: A theory of bisimulation for a fragment of concurrent ML with local names

(2002:01) Matthew Hennessy, Massimo Merro, Julian Rathke: Towards a behavioural theory of access and mobility control in distributed systems

(2001:07) Jianfeng Feng, Feng Liu: Discriminating between input signals via single neuron activity

(2001:06) Massimo Merro, Davide Sangiorgi: On asynchrony in name-passing calculi

(2001:05) Massimo Merro, Matthew Hennessy: Bisimulation congruences in safe ambients

(2001:04) Andrew Stevens, Des Watson: The effect of Java exceptions on code optimizations

(2001:03) Massimo Merro, Josva Kleist, Uwe Nestmann: Local pi-calculus at work: mobile objects as mobile processes

(2001:02) Matthew Hennessy, Julian Rathke: Typed behavioural equivalences for processes in the presence of subtyping

(2001:01) Matt Newsome, Des Watson: Proxy compilation

(2000:05) Matthew Hennessy: The security picalculus and non-interference

(2000:04) Huimin Lin, Wang Yi: A complete axiomatisation for timed automata

(2000:03) Matthew Hennessy, James Riely: Information flow vs. resource access in the asynchronous pi-calculus

(2000:02) Alan Jeffrey, Julian Rathke: Towards a theory of bisimulation for local names

(2000:01) Julian Rathke: Symbolic techniques for value-passing calculi

(1999:02) Nobuko Yoshida, Matthew Hennessy: Assigning types to processes

(1999:01) Nobuko Yoshida, Matthew Hennessy: Subtyping and locality in distributed higher order processes

(1998:05) Nobuko Yoshida: Minimality and separation results on asynchronous mobile processes

(1998:04) James Riely, Matthew Hennessy: Trust and partial typing in open systems of mobile agents

(1998:03) Matthew Hennessy, James Riely: Type-safe execution of mobile agents in anonymous networks

(1998:02) Matthew Hennessy, James Riely: Resource access control in systems of mobile agents

(1998:01) D. Pavlovic: Guarded induction on final coalgebras

(1997:05) D. Pavlovic, M.H. Escardo: Calculus in coinductive form

(1997:03) William Ferreira: On testing the observable actions of processes

(1997:02) James Riely, Matthew Hennessy: Distributed processes and location failures

(1997:01) Takis Hartonas, Matthew Hennessy: Full abstractness for a functional/concurrent language with higher-order value-passing

(1996:07) S. Abramsky, D. Pavlovic: Specifying interaction categories

(1996:06) Dusko Pavlovic: Categorical logic of names and abstraction in action calculi

(1996:05) J. Rathke, M. Hennessy: Local model checking for a value-based modal mu-calculus

(1996:04) M. Hennessy: A fully abstract denotational semantics for the pi-calculus

(1996:03) Alan Jeffrey: Semantics for core Concurrent ML using computation types

(1996:02) W. Ferreira, M. Hennessy, A.S.A. Jeffrey: Combining the typed lambda-calculus with CCS

(1995:06) M. Hennessy, H. Lin: Unique fixpoint induction for message-passing process calculi

(1995:05) W. Ferreira, M. Hennessy, A. Jeffrey: A theory of weak bisimulation for core CML

(1995:03) M. Hennessy, J. Rathke: Weak bisimulations for a calculus of broadcasting systems

(1995:02) W. Ferreira, M. Hennessy: Towards a Semantic Theory of CML

(1995:01) Matthew Hennessy, Julian Rathke: Strong Bisimulations for a Calculus of Broadcasting Systems

(1994:09) Astried Kiehn, Matthew Hennessy: On the decidability of non-interleaving process equivalences

(1994:08) Anna Ingolfsdottir: Semantic models for communicating processes with value-passing

(1994:07) Huimin Lin: Symbolic Bisimulations and Proof Systems for the Pi-Calculus

(1994:06) Edmund Robinson: Variations on Algebra: monadicity and generalisations of equational theories

(1994:05) David Murphy: Two papers concerning categories in concurrency theory

(1994:04) Luca Aceto, Alan Jeffrey: A Complete Axiomatization for Timed Bisimulation for a Class of Timed Regular Behaviours

(1994:03) Carolyn Brown, Doug Gurr: Temporal logic and categories of Petri nets

(1994:02) Xinxin Liu: Characterizing bisimulation congruence in the pi-calculus

(1994:01) Luca Aceto: Deriving complete inference systems for a class of GSOS languages generating regular behaviours

(1993:13) Alan Jeffrey: A typed, prioritized process algebra

(1993:12) Alan Jeffrey: A fully abstract semantics for concurrent graph reduction

(1993:11) Alan Jeffrey, Steve Schneider, Frits Vaandrager: A comparison of additivity axioms in timed transition systems

(1993:10) Xinxin Liu: On decidability and small model property of process equations

(1993:09) Luca Aceto, David Murphy: Timing and causality in process algebra

(1993:08) Huimin Lin: A verification tool for value-passing processes

(1993:07) Tim Regan: Process Algebra for Timed Systems

(1993:06) Luca Aceto: GSOS and Finite Labelled Transition Systems

(1993:05) M. Hennessy, H. Lin: Proof systems for message-passing process algebras

(1993:04) Huimin Lin: PAM: A Process Algebra Manipulator. (Version 1.0).

(1993:03) Matthew Hennessy, X. Liu: A modal logic for message passing processes

(1993:02) Matthew Hennessy: Timed Process Algebras: A Tutorial

(1993:01) Luca Aceto: On "Axiomatising Finite Concurrent Processes"

(1992:07) Allen Stoughton: Studying the fully abstract model of PCF within its continuous function model

(1992:06) Matthew Hennessy: A denotional model for higher-order processes

(1992:05) Edmund Robinson: Parametricity as Isomporphism

(1992:04) Edmund Robinson: Notes on the Second-Order Lambda Calculus

(1992:03) Alan Jeffrey: A chemical abstract machine for graph reduction

(1992:02) Alan Jeffrey: CSP is completely expressive

(1992:01) M. Hennessy, H. Lin: Symbolic Bisimulations

(1991:13) G. Boudol, I. Castellani, M. Hennessy, A. Kiehn: A theory of processes with localities

(1991:12) Peter J. Freyd, Edmund P. Robinson, Giuseppe Rosolini: Functorial parametricity (Now pub. in Proc. of 7th Annual IEEE Symposium on Logic in Computer Science

(1991:11) M. Hennessy: Concurrent testing of processes

(1991:10) Michael Iossif, Yoshindo Suzuki: Coding systems and recursive manifolds

(1991:09) Huimin Lin: PAM User Manual (Version 0.6)

(1991:08) M. Hennessy: A model for the pi calculus

(1991:07) M. Hennessy, A. Ingolfsdottir: Communicating processes with value-passing and assignments

(1991:06) M. Hennessy: A proof system for weak ST-Bisimulation over a finite process algebra

(1991:05) M. Hennessy, Tim Regan: A process algebra for timed systems

(1991:04) G. Boudol, I. Castellani, M. Hennessy, A. Kiehn: Observing localities

(1991:03) Luca Aceto: Action Refinement in Process Algebra

(1993:03) Huimin Lin: PAM: A Process Algebra Manipulator

(1991:01) Bernhard Steffen, Anna Ingolfsdottir: Characteristic formulae for processes with divergence

(1990:05) S. Arun-Kumar, Matthew Hennessy: An efficiency preorder for processes

(1990:04) Pedro P.B. de Oliveira: Parallel generation of combinations

(1990:03) Luca Aceto: A theory of testing for ACP

(1990:02) Matthew Hennessy, T. Regan: A temporal process algebra

(1990:01) Luca Aceto: Full abstraction for series-parallel pomsets (withdrawn)

(1989:07) Astrid Kiehn: Distributed bisimulations for finite CCS (Rewritten refer to Astrid)

(1989:06) Luca Aceto: On relating concurrency and nondeterminism

(1989:05) Matthew Hennessy: A proof system for communicating processes with value-passing

(1989:04) Matthew Hennessy, Rance Cleaveland: Testing equivalence as a bisimulation equivalence

(1989:03) Matthew Hennessy, Anna Ingolfsdottir: A theory of communicating processes with value-passing

(1989:02) Rance Cleaveland: Tableau-based model checking in the propositional Mu-calculus

(1989:01) Gavin Wraith: Categorical datatypes

(1988:06) Luca Aceto, Matthew Hennessy: Termination, deadlock and divergence

(1988:05) Matthew Hennessy: Observing processes

(1988:04) Achim Jung, Matthew Hennessy: Behaviour equivalences: an approach to the semantics of processes

(1988:03) Luca Aceto, Matthew Hennessy: Towards action-refinement in process algebras

(1988:02) Rance Cleaveland, Matthew Hennessy: Priorities in process algebras

(1988:01) Marek A. Bednarczyk: Categories of asynchronous systems

(1987:05) Ilaria Castellani, Matthew Hennessy: Distributed bisimulations

(1987:04) Matthew Hennessy: Axiomatising finite concurrent processes

(1987:03) Peter M. Williams: Averaging and eliciting expert opinion

(1987:02) Andrew M. Pitts: Polymorphism is set theoretic, constructively

(1987:01) Allen Stoughton: Substitution revisited (refer to Author)