First-order reasoning for higher-order concurrency
From MaRDI portal
Publication:456466
DOI10.1016/J.CL.2012.04.003zbMath1248.68355OpenAlexW2052295798MaRDI QIDQ456466
Vasileios Koutavas, Matthew C. B. 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
Functional programming and lambda calculus (68N18) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (5)
Characteristic bisimulation for higher-order session processes ⋮ Unnamed Item ⋮ On the expressiveness and decidability of higher-order process calculi ⋮ A Testing Theory for a Higher-Order Cryptographic Language ⋮ Unnamed Item
Cites Work
- Unnamed Item
- Unnamed Item
- Characterizing contextual equivalence in calculi with passivation
- Bisimulation for higher-order process calculi
- Testing equivalences for processes
- On reduction-based process semantics
- A Testing Theory for a Higher-Order Cryptographic Language
- Sound Bisimulations for Higher-Order Distributed Process Calculus
- A Distributed Pi-Calculus
- A bisimulation for type abstraction and recursion
- Algebraic laws for nondeterminism and concurrency
- Bisimulation, modal logic and model checking games
- From π-calculus to higher-order π-calculus — and back
- Reasoning about higher-order processes
- Contextual equivalence for higher-order pi-calculus revisited
- CONCUR 2004 - Concurrency Theory
- Small bisimulations for reasoning about higher-order imperative programs
- Game Semantics for Higher-Order Concurrency
- Foundations of Software Science and Computational Structures
- A bisimulation for dynamic sealing
This page was built for publication: First-order reasoning for higher-order concurrency
