Dr Julian Rathke: Publications

2011

Jeffrey, Alan and Rathke, Julian (2011) The Lax Braided Structure of Streaming I/O. In, Annual Conference of the European Association for Computer Science Logic, Bergen, Norway, 12 - 15 Sep 2011. LIPIcs, Leibniz International Proceedings in Informatics.

Jagadeesan, Radha, Pitcher, Corin, Rathke, Julian and Riely, James (2011) Local Memory via Layout Randomization. In, Computer Security Foundations Symposium, Domaine de l'Abbaye des Vaux de Cernay, France, 27 - 29 Jun 2011. IEEE Computer Society Press.

Francalanza, Adrian, Rathke, Julian and Sassone, Vladimiro (2011) Permission-Based Separation Logic for Message-Passing Concurrency. Logical Methods in Computer Science, 7, (3), 47.

2010

Grech, Neville, Fischer, Bernd and Rathke, Julian (2010) JEqualityGen: Generating Equality and Hashing Methods. At Generative Programming and Component Engineering,, Eindhoven, The , Netherlands, 10 - 13 Oct 2010. Association for Computing Machinery, 177-186.

Grech, Neville, Rathke, Julian and Fischer, Bernd (2010) Generating correct and efficient equality and hashing methods using JEqualityGen. In, Workshop on Generative Technologies, Paphos, Cyprus,

Rathke, Julian and Soboci\'nski, Pawel (2010) Deriving structural labelled transitions for mobile ambients. Information and Computation (Submitted)

Rathke, Julian and Sobocinski, Pawel (2010) Deriving structural labelled transitions for mobile ambients. Information and Computation, 208, (10), 1221-1242. (doi:10.1016/j.ic.2010.06.001)

2009

Rathke, Julian and Anderson, Gabrielle (2009) Migrating Protocols In Multi-Threaded Message-Passing Systems. In, Second ACM Workshop on Hot Topics in Software Upgrades (HotSWUp'09), Orlando, Florida,

Rathke, Julian and Soboci\'nski, Pawel (2009) Making the unobservable, unobservable. In, Proceedings of ICE '08 , 131-144.

2008

Rathke, Julian and Sobocinski, Pawel (2008) Deconstructing behavioural theories of mobility. In, Fifth IFIP International Conference on Theoretical Computer Science (TCS), Milan, Springer, 507-520.

Rathke, Julian and Sobocinski, Pawel (2008) Deriving structural labelled transitions for mobile ambients. In, 19th International Conference on Concurrency Theory (CONCUR), Toronto, Springer, 462-476.

2007

Rathke, J., Sassone, V. and Sobocinski, P. (2007) Semantic Barbs and Biorthogonality. In, Foundations of Software Science and Computation Structures, FOSSACS 2007 Springer, 302-316.

2006

Nguyen, Nicholas and Rathke, Julian (2006) Typed Static Analysis for Concurrent, Policy-Based, Resource Access Control. In, PASSWORD workshop, ECOOP, Nantes,

2005

Hennessy, Matthew, Yoshida, Nobuko and Rathke, Julian (2005) safeDpi: a language for controlling mobile code. Acta Informatica, 42, (4), 227-290.

Jeffrey, Alan and Rathke, Julian (2005) Contextual equivalence for higher-order pi-calculus revisited. Logical Methods in Computer Science, 1, (1)

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

Ciaffaglione, Alberto, Hennessy, Matthew and Rathke, Julian (2005) Proof methodologies for behavioural equivalence in distributed pi-calculus, Springer-Verlag (Lecture Notes in Computer Science 3731, Proc. Computer Scienc)

Jeffrey, Alan and Rathke, Julian (2005) Full abstraction for Polymorphic Pi-Calculus, Springer-Verlag (Lecture Notes in Computer Science, Proc.)

Jeffrey, Alan and Rathke, Julian, Pierce, B (ed.) (2005) A fully abstract may testing semantics for concurrent objects. Theoretical Computer Science, 338, (1-3), 17-63.

Jeffrey, Alan and Rathke, Julian (2005) Java Jr. : Fully abstract trace semantics for a Core Java Language. In, European Symposium on Programming, part of ETAPS, Edinburgh, Springer Berlin/Heidelberg, 423-438.

2004

Hennessy, Matthew and Rathke, Julian (2004) Typed behavioural equivalences for processes in the presence of subtyping. Mathematical Structures in Computer Science, 14, (5), 651-684.

Jeffrey, Alan and Rathke, Julian (2004) A theory of bisimulation for a fragment of concurrent ML with local names. Theoretical Computer Science, 323, (1-3), 1-48.

Hennessy, Matthew, Merro, Massimo and Rathke, Julian, Sassone, Vladimiro (ed.) (2004) Towards a behavioural theory of access and mobility control in distributed systems. Theoretical Computer Science, 322, (3), 615-669.

Hennessy, Matthew, Rathke, Julian and Yoshida, Nobuko (2004) SafeDpi: a language for controlling mobile code, Springer-Verlag (Lecture Notes in Computer Science, Proc. Computer Scienc)

2003

Hennessy, Matthew, Merro, Massimo and Rathke, Julian (2003) Towards a behavioural theory of access and mobility control in distributed systems, Springer-Verlag (Lecture Notes in Computer Science, 2620)

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

Jeffrey, Alan and Rathke, Julian (2003) Contextual equivalence for higher-order pi-calculus revisited, Elsevier (Lecture Notes in Computer Science, Proc.)

2002

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

Hennessy, Matthew and Rathke, Julian (2002) Typed behavioural equivalences for processes in the presence of subtyping, Elsevier (Electronic Notes in Theoretical Computer Science, 61)

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

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

Jeffrey, Alan and Rathke, Julian (2002) A fully abstract may testing semantics for concurrent objects, IEEE Computer Society Press

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

Owen, Tim, Rathke, Julian, Wakeman, Ian and Watson, Des (2002) Implementing Policies in Programs using Labelled Transition Systems. In, Cosener's House Multi-Service Networks Conference

Owen, Tim, Rathke, Julian, Wakeman, Ian and Watson, Des (2002) A Model for Controlling Program Behaviour in Pervasive Networks. In, Fifth IEEE Workshop on Networked Appliances, Liverpool,

2001

Hennessy, Matthew, Lin, Huimin and Rathke, Julian (2001) Unique fixpoint induction for message-passing process calculi. Science of Computer Programming, 41, (3), 241-275.