The following pages link to Julian Rathke (Q276478):
Displaying 27 items.
- Contextual equivalence for higher-order \(\pi\)-calculus revisited (Q276479) (← links)
- A fully abstract may testing semantics for concurrent objects (Q557787) (← links)
- (Q1276255) (redirect page) (← links)
- Bisimulations for a calculus of broadcasting systems (Q1276256) (← links)
- Towards a behavioural theory of access and mobility control in distributed systems (Q1881259) (← links)
- A theory of bisimulation for a fragment of concurrent ML with local names (Q1882896) (← links)
- Deriving structural labelled transitions for mobile ambients (Q1959484) (← links)
- Preemptive type checking (Q1994367) (← links)
- Full abstraction for polymorphic \(\pi \)-calculus (Q2474052) (← links)
- safeDpi: a language for controlling mobile code (Q2581010) (← links)
- Typed behavioural equivalences for processes in the presence of subtyping (Q2841263) (← links)
- Preemptive Type Checking in Dynamically Typed Languages (Q2851907) (← links)
- The Lax Braided Structure of Streaming I/O (Q2915690) (← links)
- Permission-Based Separation Logic for Message-Passing Concurrency (Q3224673) (← links)
- (Q3397630) (← links)
- Compositional Reachability in Petri Nets (Q3447710) (← links)
- Deriving Structural Labelled Transitions for Mobile Ambients (Q3541038) (← links)
- (Q4364391) (← links)
- (Q4417865) (← links)
- Typed behavioural equivalences for processes in the presence of subtyping (Q4653017) (← links)
- Making the Unobservable, Unobservable (Q5166617) (← links)
- Foundations of Software Science and Computation Structures (Q5308454) (← links)
- Contextual equivalence for higher-order pi-calculus revisited (Q5310635) (← links)
- Programming Languages and Systems (Q5316580) (← links)
- Formal Techniques for Networked and Distributed Systems - FORTE 2005 (Q5479165) (← links)
- Foundations of Software Science and Computational Structures (Q5705882) (← links)
- Semantic Barbs and Biorthogonality (Q5758049) (← links)
