Unique Fixpoint Induction for Value-Passing Processes (Extended Abstract). - Julian Rathke (LICS, 1997)

Local Model Checking for Value-Passing Processes (Extended Abstract). - Julian Rathke; Matthew Hennessy (TACS, 1997)

Symbolic techniques for value-passing calculi. - Julian Rathke (1997)

Resource Based Models for Asynchrony. - Julian Rathke (FoSSaCS, 1998)

Bisimulations for a Calculus of Broadcasting Systems. - Matthew Hennessy; Julian Rathke (Theor. Comput. Sci., 1998)

Towards a Theory of Bisimulation for Local Names. - Alan Jeffrey; Julian Rathke (LICS, 1999)

Unique fixpoint induction for message-passing process calculi. - Matthew Hennessy; Huimin Lin; Julian Rathke (Sci. Comput. Program., 2001)

Typed behavioural equivalences for processes in the presence of subtyping. - Matthew Hennessy; Julian Rathke (CATS, 2002)

Risky Business: Motivations for Markets in Programmable Networks. - Ian Wakeman; David Ellis; Tim Owen; Julian Rathke; Des Watson (IWAN, 2003)

Contextual Equivalence for Higher-Order π-Calculus Revisited. - Alan Jeffrey; Julian Rathke (MFPS, 2003)

Preface. - Julian Rathke (FGUC, 2004)

Towards a behavioural theory of access and mobility control in distributed systems. - Matthew Hennessy; Massimo Merro; Julian Rathke (Theor. Comput. Sci., 2004)

A theory of bisimulation for a fragment of concurrent ML with local names. - Alan Jeffrey; Julian Rathke (Theor. Comput. Sci., 2004)

Java Jr: Fully Abstract Trace Semantics for a Core Java Language. - Alan Jeffrey; Julian Rathke (ESOP, 2005)

Proof Methodologies for Behavioural Equivalence in DPI. - Alberto Ciaffaglione; Matthew Hennessy; Julian Rathke (FORTE, 2005)

safeDpi: a language for controlling mobile code. - Matthew Hennessy; Julian Rathke; Nobuko Yoshida (Acta Informatica, 2005)

Contextual equivalence for higher-order pi-calculus revisited. - Alan Jeffrey; Julian Rathke (Log. Methods Comput. Sci., 2005)

A fully abstract may testing semantics for concurrent objects. - Alan Jeffrey; Julian Rathke (Theor. Comput. Sci., 2005)

Semantic Barbs and Biorthogonality. - Julian Rathke; Vladimiro Sassone; Pawel Sobocinski 001 (FoSSaCS, 2007)

Deconstructing behavioural theories of mobility. - Julian Rathke; Pawel Sobocinski 001 (IFIP TCS, 2008)

Making the Unobservable, Unobservable. - Julian Rathke; Pawel Sobocinski 001 (ICE@ICALP, 2008)

Full abstraction for polymorphic pi-calculus. - Alan Jeffrey; Julian Rathke (Theor. Comput. Sci., 2008)

Migrating Protocols in Multi-Threaded Message-Passing Systems. - Austin Anderson; Julian Rathke (HotSWUp, 2009)

Deriving Labelled Transition Systems - A Structural Approach. - Julian Rathke; Pawel Sobocinski 001 (Bull. EATCS, 2009)

JEqualityGen: generating equality and hashing methods. - Neville Grech; Julian Rathke; Bernd Fischer 002 (GPCE, 2010)

Deriving structural labelled transitions for mobile ambients. - Julian Rathke; Pawel Sobocinski 001 (Inf. Comput., 2010)

Local Memory via Layout Randomization. - Radha Jagadeesan; Corin Pitcher; Julian Rathke; James Riely (CSF, 2011)

The Lax Braided Structure of Streaming I/O. - Alan Jeffrey; Julian Rathke (CSL, 2011)

Permission-Based Separation Logic for Message-Passing Concurrency - Adrian Francalanza; Julian Rathke; Vladimiro Sassone (Log. Methods Comput. Sci., 2011)

Dynamic Software Update for Message Passing Programs. - Gabrielle Anderson; Julian Rathke (APLAS, 2012)

Preemptive Type Checking in Dynamically Typed Languages. - Neville Grech; Julian Rathke; Bernd Fischer 002 (ICTAC, 2013)

Decomposing Petri nets - Julian Rathke; Pawel Sobocinski 001; Owen Stephens (CoRR, 2013)

Compositional Reachability in Petri Nets. - Julian Rathke; Pawel Sobocinski 001; Owen Stephens (RP, 2014)

Preemptive type checking. - Neville Grech; Bernd Fischer 002; Julian Rathke (J. Log. Algebraic Methods Program., 2018)