Home

View all

Julian Rathke: Publications

Currently viewing: List of all Publications
Making the unobservable, unobservable.
In: Proc. 1st Interaction and Concurrency Experience (ICE) . Published by Elsevier. To appear.
Julian Rathke and Pawel Sobocinski ( 2008 ).

Show BibTeX entry
Deriving structural labelled transitions for mobile ambients.
In: Proc. 19th International Conference on Concurrency Theory (Concur) . Volume 5201 of Lecture Notes in Computer Science. pp. 462--476. Published by Springer.
Julian Rathke and Pawel Sobocinski ( 2008 ).

Show BibTeX entryDownload Article (pdf-file)
Deconstructing behavioural theories of mobility.
In: Proc. Fifth IFIP International Conference On Theoretical Computer Science (TCS) . Volume 273 of IFIP. pp. 507--520. Published by Springer.
Julian Rathke and Pawel Sobocinski ( 2008 ).

Show BibTeX entryDownload Article (pdf-file)
Semantic Barbs and Biorthogonality.
In: Proc. Foundations of Software Science and Computation Structures FoSSaCS. Volume 4423 of Lecture Notes in Computer Science. pp. 302--316. Published by Springer-Verlag.
Julian Rathke and Vladimiro Sassone and Pawel Sobocinski (2007).

Show BibTeX entryDownload Article (pdf-file)
Typed Static Analysis for Concurrent, Policy-Based, Resource Access Control.
Presented at PASSWORD workshop, co-located with ECOOP 06, Nantes.
Nicholas Nguyen and Julian Rathke (2006).

Show BibTeX entryDownload Article (pdf-file)
Proof methodologies for behavioural equivalence in distributed pi-calculus.
In: Proc. Formal Techniques for Networked and Distributed Systems - FORTE 2005. Volume 3731 of Lecture Notes in Computer Science. Published by Springer-Verlag.
Alberto Ciaffaglione and Matthew Hennessy and Julian Rathke (2005).

Show BibTeX entryDownload Article (pdf-file)
Proof methodologies for behavioural equivalence in distributed pi-calculus.
Computer Science Report Nr. 03-2005. University of Sussex.
Alberto Ciaffaglione and Matthew Hennessy and Julian Rathke (2005).

Show BibTeX entryVisit the webpage of the paper
A fully abstract may testing semantics for concurrent objects.
In: Theoretical Computer Science, 338:17--63.
Alan Jeffrey and Julian Rathke (2005).

Show BibTeX entryVisit the webpage of the paper
Full abstraction for Polymorphic Pi-Calculus.
In: Proc. Foundations of Software Science and Computation Structures FoSSaCS. Volume 3441 of Lecture Notes in Computer Science. pp. 266--281. Published by Springer-Verlag.
Alan Jeffrey and Julian Rathke (2005).

Show BibTeX entryDownload Article (pdf-file)
Java Jr. : Fully abstract trace semantics for a Core Java Language.
In: Proc. European Symposium on Programming ESOP. Volume 3444 of Lecture Notes in Computer Science. pp. 423--438. Published by Springer-Verlag.
Alan Jeffrey and Julian Rathke (2005).

Show BibTeX entryDownload Article (pdf-file)
Contextual equivalence for higher-order pi-calculus revisited.
In: Logical Methods in Computer Science, 1(1:4).
Alan Jeffrey and Julian Rathke (2005).

Show BibTeX entryVisit the webpage of the paper
SafeDpi: a language for controlling mobile code.
In: Proc. Foundations of Software Science and Computation Structures FoSSaCS. Lecture Notes in Computer Science. pp. 241--256. Published by Springer-Verlag.
Matthew Hennessy and Julian Rathke and Nobuko Yoshida (2004).

Show BibTeX entryDownload Article (pdf-file)
A theory of bisimulation for a fragment of concurrent ML with local names.
In: Theoretical Computer Science, 323:1--48.
Alan Jeffrey and Julian Rathke (2004).

Show BibTeX entryDownload Article (pdf-file)
Towards a behavioural theory of access and mobility control in distributed systems.
In: Theoretical Computer Science, 322:615--669.
Matthew Hennessy and Massimo Merro and Julian Rathke (2004).

Show BibTeX entryDownload Article (pdf-file)
Typed Behavioural Equivalences for Processes in the Presence of Subtyping.
In: Mathematical Structures in Computer Science, 14:651--684.
Matthew Hennessy and Julian Rathke (2004).

Show BibTeX entryDownload Article (pdf-file)
Risky Business: Motivations for markets in programmable networks.
In: International Workshop on Active Networks IWAN, Kyoto.
Ian Wakeman and David Ellis and Tim Owen and Julian Rathke and Des Watson (2003).

Show BibTeX entryDownload Article (pdf-file)
Towards a behavioural theory of access and mobility control in distributed systems.
In: Proc. Foundations of Software Science and Computation Structures FoSSaCS. Volume 2620 of Lecture Notes in Computer Science. pp. 282--298. Published by Springer-Verlag.
Matthew Hennessy and Massimo Merro and Julian Rathke (2003).

Show BibTeX entryDownload Article (pdf-file)
Contextual equivalence for higher-order pi-calculus revisited.
In: Proc. Mathematical Foundations of Programming Semantics MFPS. Lecture Notes in Computer Science. Published by Springer-Verlag.
Alan Jeffrey and Julian Rathke (2003).

Show BibTeX entryDownload Article (pdf-file)
SafeDpi: a language for controlling mobile code.
Computer Science Report Nr. 02-2003. University of Sussex.
Matthew Hennessy and Julian Rathke and Nobuko Yoshida (2003).

Show BibTeX entryVisit the webpage of the paper
A fully abstract may testing semantics for concurrent objects.
In: Proc. 17th Annual Symposium on Logic in Computer Science LiCS. pp. 101--112. Published by IEEE Computer Society Press.
Alan Jeffrey and Julian Rathke (2002).

Show BibTeX entryDownload ArticleDownload Article (pdf-file)
Typed Behavioural Equivalences for Processes in the Presence of Subtyping.
In: Proc. Computing: Australasian Theory Symposium CATS.
Matthew Hennessy and Julian Rathke (2002).

Show BibTeX entryDownload ArticleDownload Article (pdf-file)
A Model for Controlling Program Behaviour in Pervasive Networks.
In: Proc. of the Fifth IEEE Workshop on Networked Appliances, Liverpool.
Tim Owen and Julian Rathke and Ian Wakeman and Des Watson (2002).

Show BibTeX entryDownload Article (pdf-file)
Implementing Policies in Programs using Labelled Transition Systems.
In: Cosener's House Multi-Service Networks Conference.
Tim Owen and Julian Rathke and Ian Wakeman and Des Watson (2002).

Show BibTeX entryDownload Article (pdf-file)
A theory of bisimulation for a fragment of concurrent ML with local names.
Computer Science Report Nr. 02-2002. University of Sussex.
Alan Jeffrey and Julian Rathke (2002).

Show BibTeX entryVisit the webpage of the paper
A fully abstract may testing semantics for concurrent objects.
Computer Science Report Nr. 03-2002. University of Sussex.
Alan Jeffrey and Julian Rathke (2002).

Show BibTeX entryVisit the webpage of the paper
Contextual equivalence for higher-order pi-calculus revisited.
Computer Science Report Nr. 04-2002. University of Sussex.
Alan Jeffrey and Julian Rathke (2002).

Show BibTeX entryVisit the webpage of the paper
Towards a behavioural theory of access and mobility control in distributed systems.
Computer Science Report Nr. 01-2002. University of Sussex.
Matthew Hennessy and Massimo Merro and Julian Rathke (2002).

Show BibTeX entryVisit the webpage of the paper
Unique fixpoint induction for message-passing process calculi.
In: Science of Computer Programming, 41:241--275.
Matthew Hennessy and Huimin Lin and Julian Rathke (2001).

Show BibTeX entryDownload Article
A theory of bisimulation for a fragment of concurrent ML with local names.
In: Proc. 15th Annual Symposium on Logic in Computer Science LiCS. pp. 311--321. Published by IEEE Computer Society Press.
Alan Jeffrey and Julian Rathke (2000).

Show BibTeX entryDownload ArticleDownload Article (pdf-file)
Towards a theory of bisimulation for local names.
Computer Science Report Nr. 02-2000. University of Sussex.
Alan Jeffrey and Julian Rathke (2000).

Show BibTeX entryVisit the webpage of the paper
Towards a theory of bisimulation for local names.
In: Proc. 14th Annual Symposium on Logic in Computer Science LiCS. pp. 56--66. Published by IEEE Computer Society Press.
Alan Jeffrey and Julian Rathke (1999).

Show BibTeX entryDownload ArticleDownload Article (pdf-file)
Bisimulations for a calculus of broadcasting systems.
In: Theoretical Computer Science, 200:225--260.
Matthew Hennessy and Julian Rathke (1998).

Show BibTeX entryDownload Article
Resource based models for asynchrony.
In: Proc. Foundations of Software Science and Computation Structures FoSSaCS. pp. 273--287. Published by Springer-Verlag.
Julian Rathke (1998).

Show BibTeX entryDownload ArticleDownload Article (pdf-file)
Unique fixpoint induction for value-passing processes.
In: Proc. 12th Annual Symposium on Logic in Computer Science LiCS. pp. 140--148. Published by IEEE Computer Society Press.
Julian Rathke (1997).

Show BibTeX entryDownload ArticleDownload Article (pdf-file)
Local model checking for value-passing processes.
In: Proc. International Symposium on Theoretical Aspects of Computer Software, TACS. Published by Springer-Verlag.
Julian Rathke and Matthew Hennessy (1997).

Show BibTeX entryDownload ArticleDownload Article (pdf-file)
Symbolic techniques for value-passing calculi.
PhD thesis, University of Sussex.
Julian Rathke (1997).

Show BibTeX entryDownload ArticleDownload Article (pdf-file)Visit the webpage of the paper
Local Model Checking for a Value-Based Modal mu-Calculus.
Computer Science Report Nr. 5-96. University of Sussex.
Julian Rathke and Matthew Hennessy (1996).

Show BibTeX entryVisit the webpage of the paper
Bisimulations for a Calculus of Broadcasting Systems.
In: Proc. Conference on Concurrency Theory CONCUR. Volume 962 of Lecture Notes in Computer Science. pp. 486--500. Published by Springer-Verlag.
Matthew Hennessy and Julian Rathke (1995).

Show BibTeX entryDownload ArticleDownload Article (pdf-file)
Strong Bisimulations for a Calculus of Broadcasting Systems.
Computer Science Report Nr. 1-95. University of Sussex.
Matthew Hennessy and Julian Rathke (1995).

Show BibTeX entryVisit the webpage of the paper
Weak Bisimulations for a Calculus of Broadcasting Systems.
Computer Science Report Nr. 3-95. University of Sussex.
Matthew Hennessy and Julian Rathke (1995).

Show BibTeX entryVisit the webpage of the paper