default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJulian Rathke
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j13]Neville Grech
, Bernd Fischer, Julian Rathke:
Preemptive type checking. J. Log. Algebraic Methods Program. 101: 151-181 (2018)- 2014
- [c27]Julian Rathke, Pawel Sobocinski, Owen Stephens:
Compositional Reachability in Petri Nets. RP 2014: 230-243 - 2013
- [c26]Neville Grech, Julian Rathke, Bernd Fischer:
Preemptive Type Checking in Dynamically Typed Languages. ICTAC 2013: 195-212 - [i2]Julian Rathke, Pawel Sobocinski, Owen Stephens:
Decomposing Petri nets. CoRR abs/1304.3121 (2013) - 2012
- [c25]Gabrielle Anderson, Julian Rathke:
Dynamic Software Update for Message Passing Programs. APLAS 2012: 207-222 - 2011
- [j12]Adrian Francalanza, Julian Rathke, Vladimiro Sassone:
Permission-Based Separation Logic for Message-Passing Concurrency. Log. Methods Comput. Sci. 7(3) (2011) - [c24]Radha Jagadeesan, Corin Pitcher, Julian Rathke, James Riely:
Local Memory via Layout Randomization. CSF 2011: 161-174 - [c23]Alan Jeffrey, Julian Rathke:
The Lax Braided Structure of Streaming I/O. CSL 2011: 292-306 - 2010
- [j11]Julian Rathke, Pawel Sobocinski:
Deriving structural labelled transitions for mobile ambients. Inf. Comput. 208(10): 1221-1242 (2010) - [c22]Neville Grech, Julian Rathke, Bernd Fischer:
JEqualityGen: generating equality and hashing methods. GPCE 2010: 177-186
2000 – 2009
- 2009
- [j10]Julian Rathke, Pawel Sobocinski:
Deriving Labelled Transition Systems - A Structural Approach. Bull. EATCS 98: 108-122 (2009) - [c21]Austin Anderson, Julian Rathke:
Migrating Protocols in Multi-Threaded Message-Passing Systems. HotSWUp 2009 - 2008
- [j9]Alan Jeffrey, Julian Rathke:
Full abstraction for polymorphic pi-calculus. Theor. Comput. Sci. 390(2-3): 171-196 (2008) - [c20]Julian Rathke, Pawel Sobocinski:
Deriving Structural Labelled Transitions for Mobile Ambients. CONCUR 2008: 462-476 - [c19]Julian Rathke, Pawel Sobocinski:
Deconstructing behavioural theories of mobility. IFIP TCS 2008: 507-520 - [c18]Julian Rathke, Pawel Sobocinski:
Making the Unobservable, Unobservable. ICE@ICALP 2008: 131-144 - 2007
- [c17]Julian Rathke, Vladimiro Sassone, Pawel Sobocinski:
Semantic Barbs and Biorthogonality. FoSSaCS 2007: 302-316 - 2005
- [j8]Matthew Hennessy, Julian Rathke, Nobuko Yoshida:
safeDpi: a language for controlling mobile code. Acta Informatica 42(4-5): 227-290 (2005) - [j7]Alan Jeffrey, Julian Rathke:
Contextual equivalence for higher-order pi-calculus revisited. Log. Methods Comput. Sci. 1(1) (2005) - [j6]Alan Jeffrey, Julian Rathke:
A fully abstract may testing semantics for concurrent objects. Theor. Comput. Sci. 338(1-3): 17-63 (2005) - [c16]Alan Jeffrey, Julian Rathke:
Java Jr: Fully Abstract Trace Semantics for a Core Java Language. ESOP 2005: 423-438 - [c15]Alberto Ciaffaglione, Matthew Hennessy, Julian Rathke:
Proof Methodologies for Behavioural Equivalence in DPI. FORTE 2005: 335-350 - [c14]Alan Jeffrey, Julian Rathke:
Full Abstraction for Polymorphic Pi-Calculus. FoSSaCS 2005: 266-281 - [e1]Julian Rathke:
Proceedings of the Workshop 3rd on the Foundations of Global Ubiquitous Computing, FGUC 2004, London, UK, September 3-4, 2004. Electronic Notes in Theoretical Computer Science 138(1), Elsevier 2005 [contents] - [i1]Alan Jeffrey, Julian Rathke:
Contextual equivalence for higher-order pi-calculus revisited. CoRR abs/cs/0503067 (2005) - 2004
- [j5]Matthew Hennessy, Julian Rathke:
Typed behavioural equivalences for processes in the presence of subtyping. Math. Struct. Comput. Sci. 14(5): 651-684 (2004) - [j4]Matthew Hennessy, Massimo Merro, Julian Rathke:
Towards a behavioural theory of access and mobility control in distributed systems. Theor. Comput. Sci. 322(3): 615-669 (2004) - [j3]Alan Jeffrey, Julian Rathke:
A theory of bisimulation for a fragment of concurrent ML with local names. Theor. Comput. Sci. 323(1-3): 1-48 (2004) - [c13]Matthew Hennessy, Julian Rathke, Nobuko Yoshida:
safeDpi: A Language for Controlling Mobile Code. FoSSaCS 2004: 241-256 - [c12]Julian Rathke:
Preface. FGUC 2004: 1 - 2003
- [c11]Matthew Hennessy, Massimo Merro, Julian Rathke:
Towards a Behavioural Theory of Access and Mobility Control in Distributed Systems. FoSSaCS 2003: 282-298 - [c10]Ian Wakeman, David Ellis, Tim Owen, Julian Rathke, Des Watson:
Risky Business: Motivations for Markets in Programmable Networks. IWAN 2003: 266-279 - [c9]Alan Jeffrey, Julian Rathke:
Contextual Equivalence for Higher-Order π-Calculus Revisited. MFPS 2003: 149-168 - 2002
- [c8]Alan Jeffrey, Julian Rathke:
A Fully Abstract May Testing Semantics for Concurrent Objects. LICS 2002: 101-112 - [c7]Matthew Hennessy, Julian Rathke:
Typed behavioural equivalences for processes in the presence of subtyping. CATS 2002: 122-139 - 2001
- [j2]Matthew Hennessy, Huimin Lin, Julian Rathke:
Unique fixpoint induction for message-passing process calculi. Sci. Comput. Program. 41(3): 241-275 (2001) - 2000
- [c6]Alan Jeffrey, Julian Rathke:
A Theory of Bisimulation for a Fragment of Concurrent ML with Local Names. LICS 2000: 311-321
1990 – 1999
- 1999
- [c5]Alan Jeffrey, Julian Rathke:
Towards a Theory of Bisimulation for Local Names. LICS 1999: 56-66 - 1998
- [j1]Matthew Hennessy, Julian Rathke:
Bisimulations for a Calculus of Broadcasting Systems. Theor. Comput. Sci. 200(1-2): 225-260 (1998) - [c4]Julian Rathke:
Resource Based Models for Asynchrony. FoSSaCS 1998: 273-287 - 1997
- [b1]Julian Rathke:
Symbolic techniques for value-passing calculi. University of Sussex, Falmer, East Sussex, UK, 1997 - [c3]Julian Rathke:
Unique Fixpoint Induction for Value-Passing Processes (Extended Abstract). LICS 1997: 140-148 - [c2]Julian Rathke, Matthew Hennessy:
Local Model Checking for Value-Passing Processes (Extended Abstract). TACS 1997: 250-266 - 1995
- [c1]Matthew Hennessy, Julian Rathke:
Bisimulations for a Calculus of Broadcasting Systems. CONCUR 1995: 486-500
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:04 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
