First-order reasoning for higher-order concurrency
DOI10.1016/J.CL.2012.04.003zbMATH Open1248.68355OpenAlexW2052295798MaRDI QIDQ456466FDOQ456466
Authors: Vasileios Koutavas, Matthew Hennessy 
Publication date: 25 October 2012
Published in: Computer Languages, Systems \& Structures (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cl.2012.04.003
Recommendations
- Contextual equivalence for higher-order \(\pi\)-calculus revisited
- On Bisimulation Theory in Linear Higher-Order π-Calculus
- Contextual equivalence for higher-order pi-calculus revisited
- From \(\pi \)-calculus to higher-order \(\pi \)-calculus -- and back
- Towards `up to context' reasoning about higher-order processes
Functional programming and lambda calculus (68N18) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cites Work
- Algebraic laws for nondeterminism and concurrency
- Title not available (Why is that?)
- Bisimulation for higher-order process calculi
- A Distributed Pi-Calculus
- Testing equivalences for processes
- The \(\pi\)-calculus: A theory of mobile processes
- On reduction-based process semantics
- Game Semantics for Higher-Order Concurrency
- A bisimulation for type abstraction and recursion
- Small bisimulations for reasoning about higher-order imperative programs
- Contextual equivalence for higher-order pi-calculus revisited
- CONCUR 2004 - Concurrency Theory
- A Testing Theory for a Higher-Order Cryptographic Language
- Sound bisimulations for higher-order distributed process calculus
- Bisimulation, modal logic and model checking games
- From \(\pi \)-calculus to higher-order \(\pi \)-calculus -- and back
- Reasoning about higher-order processes
- Foundations of Software Science and Computational Structures
- A bisimulation for dynamic sealing
- Characterizing contextual equivalence in calculi with passivation
Cited In (12)
- A Testing Theory for a Higher-Order Cryptographic Language
- Contextual equivalence for higher-order \(\pi\)-calculus revisited
- Title not available (Why is that?)
- Contextual equivalence for higher-order pi-calculus revisited
- Foundations of Software Science and Computation Structures
- Characteristic bisimulation for higher-order session processes
- Modal logics for nominal transition systems
- On the expressiveness and decidability of higher-order process calculi
- On the discriminating power of passivation and higher-order interaction
- Towards `up to context' reasoning about higher-order processes
- On decidability of the bisimilarity on higher-order processes with parameterization
- From \(\pi \)-calculus to higher-order \(\pi \)-calculus -- and back
This page was built for publication: First-order reasoning for higher-order concurrency
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q456466)
