Julian Rathke

According to our database1, Julian Rathke
  • authored at least 40 papers between 1995 and 2014.
  • has a "Dijkstra number"2 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2014
Compositional Reachability in Petri Nets.
Proceedings of the Reachability Problems - 8th International Workshop, 2014

2013
Decomposing Petri nets
CoRR, 2013

Preemptive Type Checking in Dynamically Typed Languages.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2013, 2013

2012
Dynamic Software Update for Message Passing Programs.
Proceedings of the Programming Languages and Systems - 10th Asian Symposium, 2012

2011
Permission-Based Separation Logic for Message-Passing Concurrency
Logical Methods in Computer Science, 2011

The Lax Braided Structure of Streaming I/O.
Proceedings of the Computer Science Logic, 2011

Local Memory via Layout Randomization.
Proceedings of the 24th IEEE Computer Security Foundations Symposium, 2011

2010
Deriving structural labelled transitions for mobile ambients.
Inf. Comput., 2010

JEqualityGen: generating equality and hashing methods.
Proceedings of the Generative Programming And Component Engineering, 2010

2009
Making the Unobservable, Unobservable.
Electr. Notes Theor. Comput. Sci., 2009

Deriving Labelled Transition Systems - A Structural Approach.
Bulletin of the EATCS, 2009

Migrating Protocols in Multi-Threaded Message-Passing Systems.
Proceedings of the 2nd ACM Workshop on Hot Topics in Software Upgrades, 2009

2008
Full abstraction for polymorphic pi-calculus.
Theor. Comput. Sci., 2008

Deconstructing behavioural theories of mobility.
Proceedings of the Fifth IFIP International Conference On Theoretical Computer Science, 2008

Deriving Structural Labelled Transitions for Mobile Ambients.
Proceedings of the CONCUR 2008 - Concurrency Theory, 19th International Conference, 2008

2007
Semantic Barbs and Biorthogonality.
Proceedings of the Foundations of Software Science and Computational Structures, 2007

2005
A fully abstract may testing semantics for concurrent objects.
Theor. Comput. Sci., 2005

Contextual equivalence for higher-order pi-calculus revisited.
Logical Methods in Computer Science, 2005

Preface.
Electr. Notes Theor. Comput. Sci., 2005

Contextual equivalence for higher-order pi-calculus revisited
CoRR, 2005

safeDpi: a language for controlling mobile code.
Acta Inf., 2005

Full Abstraction for Polymorphic Pi-Calculus.
Proceedings of the Foundations of Software Science and Computational Structures, 2005

Proof Methodologies for Behavioural Equivalence in DPI.
Proceedings of the Formal Techniques for Networked and Distributed Systems, 2005

Java Jr: Fully Abstract Trace Semantics for a Core Java Language.
Proceedings of the Programming Languages and Systems, 2005

2004
A theory of bisimulation for a fragment of concurrent ML with local names.
Theor. Comput. Sci., 2004

Towards a behavioural theory of access and mobility control in distributed systems.
Theor. Comput. Sci., 2004

Typed behavioural equivalences for processes in the presence of subtyping.
Mathematical Structures in Computer Science, 2004

safeDpi: A Language for Controlling Mobile Code.
Proceedings of the Foundations of Software Science and Computation Structures, 2004

2003
Risky Business: Motivations for Markets in Programmable Networks.
Proceedings of the Active Networks, IFIP TC6 5th International Workshop, 2003

Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems.
Proceedings of the Foundations of Software Science and Computational Structures, 2003

2002
Typed behavioural equivalences for processes in the presence of subtyping.
Electr. Notes Theor. Comput. Sci., 2002

A Fully Abstract May Testing Semantics for Concurrent Objects.
Proceedings of the 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 2002

2001
Unique fixpoint induction for message-passing process calculi.
Sci. Comput. Program., 2001

2000
A Theory of Bisimulation for a Fragment of Concurrent ML with Local Names.
Proceedings of the 15th Annual IEEE Symposium on Logic in Computer Science, 2000

1999
Towards a Theory of Bisimulation for Local Names.
Proceedings of the 14th Annual IEEE Symposium on Logic in Computer Science, 1999

1998
Bisimulations for a Calculus of Broadcasting Systems.
Theor. Comput. Sci., 1998

Resource Based Models for Asynchrony.
Proceedings of the Foundations of Software Science and Computation Structure, 1998

1997
Local Model Checking for Value-Passing Processes (Extended Abstract).
Proceedings of the Theoretical Aspects of Computer Software, Third International Symposium, 1997

Unique Fixpoint Induction for Value-Passing Processes (Extended Abstract).
Proceedings of the Proceedings, 12th Annual IEEE Symposium on Logic in Computer Science, Warsaw, Poland, June 29, 1997

1995
Bisimulations for a Calculus of Broadcasting Systems.
Proceedings of the CONCUR '95: Concurrency Theory, 1995


  Loading...