Processes against tests: on defining contextual equivalences
From MaRDI portal
Publication:2079681
DOI10.1016/j.jlamp.2022.100799OpenAlexW4281608807WikidataQ114159187 ScholiaQ114159187MaRDI QIDQ2079681
Clément Aubert, Daniele Varacca
Publication date: 30 September 2022
Published in: Journal of Logical and Algebraic Methods in Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.08187
Related Items (2)
When privacy fails, a formula describes an attack: a complete and compositional verification method for the applied \(\pi\)-calculus ⋮ The correctness of concurrencies in (reversible) concurrent calculi
Uses Software
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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Observation equivalence as a testing equivalence
- 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
- An efficiency preorder for processes
- 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
- A theory of monitors
- The reversible temporal process language
- 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
- Proceedings 14th Interaction and Concurrency Experience
- A Fresh Look at the λ-Calculus
- 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
- Foundations of Software Science and Computation Structures
- A calculus of lambda calculus contexts
- A typed context calculus
This page was built for publication: Processes against tests: on defining contextual equivalences
