The University of Southampton
Warning! Your browser is out-of-date and not compatible with this website. Please download a new secure and faster browser to view this website correctly.

Publications

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.

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

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.

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

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) 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.

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

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

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

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

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

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

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,

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) A fully abstract may testing semantics for concurrent objects, IEEE Computer Society Press

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. ).

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 and Rathke, Julian (2004) Typed behavioural equivalences for processes in the presence of subtyping. Mathematical Structures in Computer Science, 14, (5), 651-684.

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).

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

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).

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

Rathke, Julian and Sobocinski, Pawel (2008) Deconstructing behavioural theories of mobility. In, Fifth IFIP International Conference on Theoretical Computer Science (TCS), Milano, IT, , 507-520. (doi:10.1007/978-0-387-09680-3_34).

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.

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 Sobocinski, Pawel (2010) Deriving structural labelled transitions for mobile ambients. [in special issue: 19th International Conference on Concurrency Theory (CONCUR 2008)] Information and Computation, 208, (10), 1221-1242. (doi:10.1016/j.ic.2010.06.001).

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

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,

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.

Francalanza, Adrian, Rathke, Julian and Sassone, Vladimiro (2011) Permission-based separation logic for message-passing concurrency. Logical Methods in Computer Science, 7, (3), 1-47. (doi:10.2168/LMCS-7(3:7)2011).

Jagadeesan, Radha, Pitcher, Corin, Rathke, Julian and Riely, James (2011) Local memory via layout randomization. In, IEEE 24th Computer Security Foundations Symposium (CSF), Cernay-la-Ville, FR, 27 - 29 Jun 2011. IEEE Computer Society Press, 161-174. (doi:10.1109/CSF.2011.18).

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.

Rathke, Julian and Jeffrey, Alan (2008) Full abstraction for polymorphic ?-calculus. Theoretical Computer Science, 390, (2-3), 171-196. (doi:10.1016/j.tcs.2007.09.020).

Grech, Neville, Rathke, Julian and Fischer, Bernd (2013) Preemptive type checking in dynamically typed languages. In, 10th International Colloquium on Theoretical Aspects of Computing, Shanghai, China, 04 - 06 Sep 2013. Springer-Verlag, 195-212.

Rathke, Julian, Sobocinski, Pawel and Stephens, Owen (2014) Compositional reachability in Petri nets. In, 8th International Workshop on Reachability Problems., Oxford, UK, 22 - 24 Sep 2014. Springer-Verlag, 230-243. (doi:10.1007/978-3-319-11439-2_18).

Contact

Share this profile FacebookGoogle+TwitterWeibo

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×