Processes, systems \& tests: defining contextual equivalences
From MaRDI portal
Publication:6649539
DOI10.4204/eptcs.347.1MaRDI QIDQ6649539
Daniele Varacca, Clément Aubert
Publication date: 6 December 2024
Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Models for concurrency: Towards a classification
- The lambda calculus. Its syntax and semantics. Rev. ed.
- A calculus of communicating systems
- Bisimulation through probabilistic testing
- A calculus of mobile processes. I
- A calculus of mobile processes. II
- Fully abstract models of typed \(\lambda\)-calculi
- A calculus for cryptographic protocols: The spi calculus
- Testing equivalences for processes
- On reduction-based process semantics
- A hierarchy of equivalences for asynchronous calculi
- Tau laws for pi calculus
- Testing equivalence for mobile processes
- A theory of bisimulation for the \(\pi\)-calculus
- The name discipline of uniform receptiveness
- Static versus dynamic reversibility in CCS
- Reversibility and Models for Concurrency
- Proofs as Executions
- Full Abstraction for Resource Calculus with Tests
- Introduction to Bisimulation and Coinduction
- The Applied Pi Calculus
- A Distributed Pi-Calculus
- Behavioral theory for mobile ambients
- On the Expressive Power of Primitives for Compensation Handling
- Beta reduction is invariant, indeed
- A Lambda Calculus for Quantum Computation
- Equational properties of mobile ambients
- A Fresh Look at the λ-Calculus
- Session Types with Arithmetic Refinements
- Quasi-Open Bisimilarity with Mismatch is Intuitionistic
- Forward-Reverse Observational Equivalences in CCSK
- Explicit Identifiers and Contexts in Reversible Concurrent Calculus
- Barbed bisimulation
- Contextual modal type theory
- CONCUR 2004 - Concurrency Theory
- Concurrent Flexible Reversibility
- Linear logic propositions as session types
- CONCUR 2005 – Concurrency Theory
- Foundations of Software Science and Computation Structures
- A calculus of lambda calculus contexts
- A typed context calculus
- Modal and temporal logics for processes
This page was built for publication: Processes, systems \& tests: defining contextual equivalences
