The following pages link to A calculus of mobile processes. I (Q1198548):
Displaying 50 items.
- Mixed Sessions (Q5041119) (← links)
- Trace Equivalence and Epistemic Logic to Express Security Properties (Q5041278) (← links)
- A categorical framework for congruence of applicative bisimilarity in higher-order languages (Q5043601) (← links)
- From π-calculus to higher-order π-calculus — and back (Q5044732) (← links)
- More problems in rewriting (Q5055812) (← links)
- From a concurrent λ-calculus to the π-calculus (Q5055881) (← links)
- Stratified petri nets (Q5055926) (← links)
- A Fresh Look at the λ-Calculus (Q5089000) (← links)
- (Q5089025) (← links)
- Analysing Spatial Properties on Neighbourhood Spaces (Q5089239) (← links)
- π-Calculus semantics of object-oriented programming languages (Q5096237) (← links)
- A foundation for higher-order concurrent constraint programming (Q5096300) (← links)
- On the decidability of process equivalences for the π-calculus (Q5096384) (← links)
- πI: A symmetric calculus based on internal mobility (Q5096730) (← links)
- Complete inference systems for weak bisimulation equivalences in the π-calculus (Q5096731) (← links)
- Confluence of processes and systems of objects (Q5096733) (← links)
- (Q5111635) (← links)
- Towards Secrecy for Rewriting in Weakly Adhesive Categories (Q5166615) (← links)
- A Model of Dynamic Systems (Q5170742) (← links)
- Observing Success in the Pi-Calculus (Q5240185) (← links)
- A Prospectus for Mobile Broadcasting Systems (Q5262975) (← links)
- Specification and verification for semi-structured data (Q5291135) (← links)
- A logical analysis of aliasing in imperative higher-order functions (Q5308091) (← links)
- Types for Secure Pattern Matching with Local Knowledge in Universal Concurrent Constraint Programming (Q5325767) (← links)
- Behaviour, Interaction and Dynamics (Q5403078) (← links)
- Pict Correctness Revisited (Q5428913) (← links)
- Types for ambient and process mobility (Q5458067) (← links)
- Deriving Bisimulation Congruences in the Presence of Negative Application Conditions (Q5458376) (← links)
- Open Bisimulation for the Concurrent Constraint Pi-Calculus (Q5458401) (← links)
- The Conversation Calculus: A Model of Service-Oriented Computation (Q5458402) (← links)
- Global Computing (Q5464841) (← links)
- Completeness and Herbrand theorems for nominal logic (Q5477637) (← links)
- EXPLOITING SYMMETRIES FOR TESTING EQUIVALENCE VERIFICATION IN THE SPI CALCULUS (Q5484904) (← links)
- Journeys in non-classical computation I: A grand challenge for computing research (Q5492115) (← links)
- Communicating Sequential Processes. The First 25 Years (Q5709368) (← links)
- Automata, Languages and Programming (Q5716867) (← links)
- A Stable Non-interleaving Early Operational Semantics for the Pi-Calculus (Q5738986) (← links)
- A Resource Analysis of the π-calculus (Q5739364) (← links)
- Equivalence relations for modular performance evaluation in dtsPBC (Q5740349) (← links)
- cJoin: Join with communicating transactions (Q5740633) (← links)
- CaSPiS: a calculus of sessions, pipelines and services (Q5740635) (← links)
- Model checking usage policies (Q5740636) (← links)
- Non-deterministic structures of computation (Q5740658) (← links)
- On recursive operations over logic LTS (Q5740660) (← links)
- Linearity, session types and the Pi calculus (Q5741562) (← links)
- On asynchronous eventful session semantics (Q5741564) (← links)
- An extensible approach to session polymorphism (Q5741569) (← links)
- Applying a testing approach to the Calculus of Fair Ambients (Q5850754) (← links)
- (Q5856409) (← links)
- Bidirectional Runtime Enforcement of First-Order Branching-Time Properties (Q5883741) (← links)
