- CSB - MetaPress - Google - Bing - Yahoo
 | 2011 | |
|---|---|---|
| 36 |      | Radha Jagadeesan, Corin Pitcher, Julian Rathke, James Riely: Local Memory via Layout Randomization. CSF 2011: 161-174 |
| 35 | | Alan Jeffrey, Julian Rathke: The Lax Braided Structure of Streaming I/O. CSL 2011: 292-306 |
| 34 | | Adrian Francalanza, Julian Rathke, Vladimiro Sassone: Permission-Based Separation Logic for Message-Passing Concurrency Logical Methods in Computer Science 7(3): (2011) |
| 2010 | ||
| 33 | | Neville Grech, Julian Rathke, Bernd Fischer: JEqualityGen: generating equality and hashing methods. GPCE 2010: 177-186 |
| 32 | | Julian Rathke, Pawel Sobocinski: Deriving structural labelled transitions for mobile ambients. Inf. Comput. 208(10): 1221-1242 (2010) |
| 2009 | ||
| 31 | | Austin Anderson, Julian Rathke: Migrating Protocols in Multi-Threaded Message-Passing Systems. HotSWUp 2009 |
| 30 |  | Julian Rathke, Pawel Sobocinski: Deriving Labelled Transition Systems - A Structural Approach. Bulletin of the EATCS 98: 108-122 (2009) |
| 29 | | Julian Rathke, Pawel Sobocinski: Making the Unobservable, Unobservable. Electr. Notes Theor. Comput. Sci. 229(3): 131-144 (2009) |
| 2008 | ||
| 28 | | Julian Rathke, Pawel Sobocinski: Deriving Structural Labelled Transitions for Mobile Ambients. CONCUR 2008: 462-476 |
| 27 | | Julian Rathke, Pawel Sobocinski: Deconstructing behavioural theories of mobility. IFIP TCS 2008: 507-520 |
| 26 | | Alan Jeffrey, Julian Rathke: Full abstraction for polymorphic pi-calculus. Theor. Comput. Sci. 390(2-3): 171-196 (2008) |
| 2007 | ||
| 25 | | Julian Rathke, Vladimiro Sassone, Pawel Sobocinski: Semantic Barbs and Biorthogonality. FoSSaCS 2007: 302-316 |
| 2005 | ||
| 24 | | Alan Jeffrey, Julian Rathke: Java Jr: Fully Abstract Trace Semantics for a Core Java Language. ESOP 2005: 423-438 |
| 23 | | Alberto Ciaffaglione, Matthew Hennessy, Julian Rathke: Proof Methodologies for Behavioural Equivalence in DPI. FORTE 2005: 335-350 |
| 22 | | Alan Jeffrey, Julian Rathke: Full Abstraction for Polymorphic Pi-Calculus. FoSSaCS 2005: 266-281 |
| 21 | | Matthew Hennessy, Julian Rathke, Nobuko Yoshida: safeDpi: a language for controlling mobile code. Acta Inf. 42(4-5): 227-290 (2005) |
| 20 | | Alan Jeffrey, Julian Rathke: Contextual equivalence for higher-order pi-calculus revisited CoRR abs/cs/0503067: (2005) |
| 19 | | Julian Rathke: Preface. Electr. Notes Theor. Comput. Sci. 138(1): 1 (2005) |
| 18 | | Alan Jeffrey, Julian Rathke: Contextual equivalence for higher-order pi-calculus revisited. Logical Methods in Computer Science 1(1): (2005) |
| 17 | | Alan Jeffrey, Julian Rathke: A fully abstract may testing semantics for concurrent objects. Theor. Comput. Sci. 338(1-3): 17-63 (2005) |
| 2004 | ||
| 16 | | Matthew Hennessy, Julian Rathke, Nobuko Yoshida: safeDpi: A Language for Controlling Mobile Code. FoSSaCS 2004: 241-256 |
| 15 | | 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 | | 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 | | 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 | | Matthew Hennessy, Massimo Merro, Julian Rathke: Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems. FoSSaCS 2003: 282-298 |
| 11 | | Ian Wakeman, David Ellis, Tim Owen, Julian Rathke, Des Watson: Risky Business: Motivations for Markets in Programmable Networks. IWAN 2003: 266-279 |
| 2002 | ||
| 10 | | Alan Jeffrey, Julian Rathke: A Fully Abstract May Testing Semantics for Concurrent Objects. LICS 2002: 101-112 |
| 9 | | Matthew Hennessy, Julian Rathke: Typed behavioural equivalences for processes in the presence of subtyping. Electr. Notes Theor. Comput. Sci. 61: 122-139 (2002) |
| 2001 | ||
| 8 | | Matthew Hennessy, Huimin Lin, Julian Rathke: Unique fixpoint induction for message-passing process calculi. Sci. Comput. Program. 41(3): 241-275 (2001) |
| 2000 | ||
| 7 | | Alan Jeffrey, Julian Rathke: A Theory of Bisimulation for a Fragment of Concurrent ML with Local Names. LICS 2000: 311-321 |
| 1999 | ||
| 6 | | Alan Jeffrey, Julian Rathke: Towards a Theory of Bisimulation for Local Names. LICS 1999: 56-66 |
| 1998 | ||
| 5 | | Julian Rathke: Resource Based Models for Asynchrony. FoSSaCS 1998: 273-287 |
| 4 | | Matthew Hennessy, Julian Rathke: Bisimulations for a Calculus of Broadcasting Systems. Theor. Comput. Sci. 200(1-2): 225-260 (1998) |
| 1997 | ||
| 3 | | 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 |
| 1 | Austin Anderson | [31] |
| 2 | Alberto Ciaffaglione | [23] |
| 3 | David Ellis | [11] |
| 4 | Bernd Fischer | [33] |
| 5 | Adrian Francalanza | [34] |
| 6 | Neville Grech | [33] |
| 7 | Matthew Hennessy | [1] [2] [4] [8] [9] [12] [14] [15] [16] [21] [23] |
| 8 | Radha Jagadeesan | [36] |
| 9 | Alan Jeffrey | [6] [7] [10] [13] [17] [18] [20] [22] [24] [26] [35] |
| 10 | Huimin Lin | [8] |
| 11 | Massimo Merro | [12] [14] |
| 12 | Tim Owen | [11] |
| 13 | Corin Pitcher | [36] |
| 14 | James Riely | [36] |
| 15 | Vladimiro Sassone | [25] [34] |
| 16 | Pawel Sobocinski | [25] [27] [28] [29] [30] [32] |
| 17 | Ian Wakeman | [11] |
| 18 | Des Watson | [11] |
| 19 | Nobuko Yoshida | [16] [21] |
Colors in the list of coauthors
Last update Sat May 26 02:31:23 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page