The following pages link to (Q3837262):
Displaying 50 items.
- Reversible client/server interactions (Q315298) (← links)
- Name-passing calculi: from fusions to preorders and types (Q342734) (← links)
- Orchestrated session compliance (Q347361) (← links)
- An algebra of behavioural types (Q418153) (← links)
- Linear logical relations and observational equivalences for session-based concurrency (Q476190) (← links)
- Strong normalisation in the \(\pi\)-calculus (Q598201) (← links)
- A taxonomy of process calculi for distribution and mobility (Q660996) (← links)
- Towards an algebraic theory of typed mobile processes (Q817843) (← links)
- PiDuce- A project for experimenting web services technologies (Q838158) (← links)
- Space-aware ambients and processes (Q875514) (← links)
- A behavioural theory for a \(\pi\)-calculus with preorders (Q890617) (← links)
- Semantic subtyping for the pi-calculus (Q930882) (← links)
- Backwards type analysis of asynchronous method calls (Q953530) (← links)
- Linearity and bisimulation (Q997996) (← links)
- An interpretation of typed objects into typed \(\pi\)-calculus (Q1271311) (← links)
- On the expressiveness of internal mobility in name-passing calculi (Q1276243) (← links)
- A calculus for cryptographic protocols: The spi calculus (Q1283776) (← links)
- Typing correspondence assertions for communication protocols (Q1399972) (← links)
- On modelling mobility (Q1575151) (← links)
- Types for access control (Q1575157) (← links)
- Session types and subtyping for orchestrated interactions (Q1633346) (← links)
- Secrecy and group creation (Q1763430) (← links)
- The security pi-calculus and non-interference (Q1772311) (← links)
- Analysing input/output-capabilities of mobile processes with a generic type system (Q1772312) (← links)
- What is a ``good'' encoding of guarded choice? (Q1854329) (← links)
- Type reconstruction for linear \(\pi\)-calculus with I/O subtyping. (Q1854358) (← links)
- Static analysis for the \(\pi\)-calculus with applications to security (Q1854437) (← links)
- Resource access control in systems of mobile agents (Q1854507) (← links)
- Assigning types to processes (Q1854525) (← links)
- Type inference for variant object types (Q1854549) (← links)
- Towards a behavioural theory of access and mobility control in distributed systems (Q1881259) (← links)
- A generic type system for the pi-calculus (Q1884932) (← links)
- Type inference for record concatenation and subtyping (Q1887147) (← links)
- Partition refinement of component interaction automata (Q1951613) (← links)
- The name discipline of uniform receptiveness (Q1960533) (← links)
- Processes against tests: on defining contextual equivalences (Q2079681) (← links)
- Eager functions as processes (Q2123050) (← links)
- Session typing and asynchronous subtyping for the higher-order \(\pi\)-calculus (Q2343135) (← links)
- Characteristic bisimulation for higher-order session processes (Q2357655) (← links)
- Linear forwarders (Q2384926) (← links)
- Types and full abstraction for polyadic \(\pi\)-calculus (Q2387197) (← links)
- Precise subtyping for synchronous multiparty sessions (Q2423747) (← links)
- Algorithmic type checking for a pi-calculus with name matching and session types (Q2436508) (← links)
- A type system for lock-free processes (Q2497143) (← links)
- Mobile objects as mobile processes (Q2497145) (← links)
- Genericity and the \(\pi\)-calculus (Q2576663) (← links)
- MOMI: a calculus for mobile mixins (Q2576664) (← links)
- Subtyping for session types in the pi calculus (Q2576666) (← links)
- Type-based information flow analysis for the \(\pi\)-calculus (Q2581011) (← links)
- A general framework for types in graph rewriting (Q2581012) (← links)
