Characterizing contextual equivalence in calculi with passivation
DOI10.1016/J.IC.2011.08.002zbMATH Open1251.68160OpenAlexW2018456712MaRDI QIDQ651309FDOQ651309
Authors: Sergueï Lenglet, Alan Schmitt, Jean-Bernard Stefani 
Publication date: 12 December 2011
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2011.08.002
Recommendations
Logic in computer science (03B70) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- A congruence rule format for name-passing process calculi
- The M-calculus: a higher-order distributed process calculus
- Normal Bisimulations in Calculi with Passivation
- Title not available (Why is that?)
- Bisimulation for higher-order process calculi
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Proving congruence of bisimulation in functional programming languages
- The \(\pi\)-calculus: A theory of mobile processes
- Mobile ambients
- Deriving Structural Labelled Transitions for Mobile Ambients
- Reactive Systems, Barbed Semantics, and the Mobile Ambients
- CONCUR 2005 – Concurrency Theory
- Contextual equivalence for higher-order pi-calculus revisited
- Global Computing
- Foundations of Software Science and Computation Structures
- A theory of bisimulation for a fragment of concurrent ML with local names
- Sound bisimulations for higher-order distributed process calculus
- Behavioral theory for mobile ambients
- Plain CHOCS. A second generation calculus for higher order processes
- A CPS encoding of name-passing in higher-order mobile embedded resources
- Howe’s Method for Calculi with Passivation
- The seal calculus
- Communication and mobility control in boxed ambients
- safeDpi: a language for controlling mobile code
- A congruence format for name-passing calculi
- Title not available (Why is that?)
- Acute: High-level programming language design for distributed computation
Cited In (9)
- On parameterization of higher-order processes
- Howe’s Method for Calculi with Passivation
- Parameterizing higher-order processes on names and processes
- Howe's method for contextual semantics
- \(\mathrm{HO}\pi\) in Coq
- First-order reasoning for higher-order concurrency
- On the discriminating power of passivation and higher-order interaction
- Title not available (Why is that?)
- Higher-order processes with parameterization over names and processes
Uses Software
This page was built for publication: Characterizing contextual equivalence in calculi with passivation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q651309)
