| 2008 |
|---|
| 28 | EE | Julian Rathke,
Pawel Sobocinski:
Deriving Structural Labelled Transitions for Mobile Ambients.
CONCUR 2008: 462-476 |
| 27 | EE | Julian Rathke,
Pawel Sobocinski:
Deconstructing behavioural theories of mobility.
IFIP TCS 2008: 507-520 |
| 26 | EE | Alan Jeffrey,
Julian Rathke:
Full abstraction for polymorphic pi-calculus.
Theor. Comput. Sci. 390(2-3): 171-196 (2008) |
| 2007 |
|---|
| 25 | EE | Julian Rathke,
Vladimiro Sassone,
Pawel Sobocinski:
Semantic Barbs and Biorthogonality.
FoSSaCS 2007: 302-316 |
| 2005 |
|---|
| 24 | EE | Alan Jeffrey,
Julian Rathke:
Java Jr: Fully Abstract Trace Semantics for a Core Java Language.
ESOP 2005: 423-438 |
| 23 | EE | Alberto Ciaffaglione,
Matthew Hennessy,
Julian Rathke:
Proof Methodologies for Behavioural Equivalence in DPI.
FORTE 2005: 335-350 |
| 22 | EE | Alan Jeffrey,
Julian Rathke:
Full Abstraction for Polymorphic Pi-Calculus.
FoSSaCS 2005: 266-281 |
| 21 | EE | Matthew Hennessy,
Julian Rathke,
Nobuko Yoshida:
safeDpi: a language for controlling mobile code.
Acta Inf. 42(4-5): 227-290 (2005) |
| 20 | EE | Alan Jeffrey,
Julian Rathke:
Contextual equivalence for higher-order pi-calculus revisited
CoRR abs/cs/0503067: (2005) |
| 19 | EE | Julian Rathke:
Preface.
Electr. Notes Theor. Comput. Sci. 138(1): 1 (2005) |
| 18 | EE | Alan Jeffrey,
Julian Rathke:
Contextual equivalence for higher-order pi-calculus revisited.
Logical Methods in Computer Science 1(1): (2005) |
| 17 | EE | Alan Jeffrey,
Julian Rathke:
A fully abstract may testing semantics for concurrent objects.
Theor. Comput. Sci. 338(1-3): 17-63 (2005) |
| 2004 |
|---|
| 16 | EE | Matthew Hennessy,
Julian Rathke,
Nobuko Yoshida:
safeDpi: A Language for Controlling Mobile Code.
FoSSaCS 2004: 241-256 |
| 15 | 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) |
| 14 | 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) |
| 13 | EE | Alan Jeffrey,
Julian Rathke:
A theory of bisimulation for a fragment of concurrent ML with local names.
Theor. Comput. Sci. 323(1-3): 1-48 (2004) |
| 2003 |
|---|
| 12 | EE | Matthew Hennessy,
Massimo Merro,
Julian Rathke:
Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems.
FoSSaCS 2003: 282-298 |
| 11 | EE | Ian Wakeman,
David Ellis,
Tim Owen,
Julian Rathke,
Des Watson:
Risky Business: Motivations for Markets in Programmable Networks.
IWAN 2003: 266-279 |
| 2002 |
|---|
| 10 | EE | Alan Jeffrey,
Julian Rathke:
A Fully Abstract May Testing Semantics for Concurrent Objects.
LICS 2002: 101-112 |
| 9 | EE | Matthew Hennessy,
Julian Rathke:
Typed behavioural equivalences for processes in the presence of subtyping.
Electr. Notes Theor. Comput. Sci. 61: (2002) |
| 2001 |
|---|
| 8 | | Matthew Hennessy,
H. Lin,
Julian Rathke:
Unique fixpoint induction for message-passing process calculi.
Sci. Comput. Program. 41(3): 241-275 (2001) |
| 2000 |
|---|
| 7 | EE | Alan Jeffrey,
Julian Rathke:
A Theory of Bisimulation for a Fragment of Concurrent ML with Local Names.
LICS 2000: 311-321 |
| 1999 |
|---|
| 6 | EE | Alan Jeffrey,
Julian Rathke:
Towards a Theory of Bisimulation for Local Names.
LICS 1999: 56-66 |
| 1998 |
|---|
| 5 | EE | Julian Rathke:
Resource Based Models for Asynchrony.
FoSSaCS 1998: 273-287 |
| 4 | EE | Matthew Hennessy,
Julian Rathke:
Bisimulations for a Calculus of Broadcasting Systems.
Theor. Comput. Sci. 200(1-2): 225-260 (1998) |
| 1997 |
|---|
| 3 | EE | Julian Rathke:
Unique Fixpoint Induction for Value-Passing Processes (Extended Abstract).
LICS 1997: 140-148 |
| 2 | | Julian Rathke,
Matthew Hennessy:
Local Model Checking for Value-Passing Processes (Extended Abstract).
TACS 1997: 250-266 |
| 1995 |
|---|
| 1 | | Matthew Hennessy,
Julian Rathke:
Bisimulations for a Calculus of Broadcasting Systems.
CONCUR 1995: 486-500 |
