First-order reasoning for higher-order concurrency

DOI10.1016/J.CL.2012.04.003MaRDI QIDQ456466zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

Hennessy-Milner logicbisimulationhigher-order concurrency

Mathematics Subject Classification ID

Functional programming and lambda calculus (68N18) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Contextual equivalence for higher-order -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

Cites work

• scientific article; zbMATH DE number 42752 (Why is no real title available?)
• A Distributed Pi-Calculus
• A Testing Theory for a Higher-Order Cryptographic Language
• A bisimulation for dynamic sealing
• A bisimulation for type abstraction and recursion
• Algebraic laws for nondeterminism and concurrency
• Bisimulation for higher-order process calculi
• Bisimulation, modal logic and model checking games
• CONCUR 2004 - Concurrency Theory
• Characterizing contextual equivalence in calculi with passivation
• Contextual equivalence for higher-order pi-calculus revisited
• Foundations of Software Science and Computational Structures
• From \(\pi \)-calculus to higher-order \(\pi \)-calculus -- and back
• Game Semantics for Higher-Order Concurrency
• On reduction-based process semantics
• Reasoning about higher-order processes
• Small bisimulations for reasoning about higher-order imperative programs
• Sound bisimulations for higher-order distributed process calculus
• Testing equivalences for processes
• The \(\pi\)-calculus: A theory of mobile processes

Cited in

(12)

• From \(\pi \)-calculus to higher-order \(\pi \)-calculus -- and back
• Contextual equivalence for higher-order \(\pi\)-calculus revisited
• Characteristic bisimulation for higher-order session processes
• On decidability of the bisimilarity on higher-order processes with parameterization
• scientific article; zbMATH DE number 7407797 (Why is no real title available?)
• Modal logics for nominal transition systems
• A Testing Theory for a Higher-Order Cryptographic Language
• On the discriminating power of passivation and higher-order interaction
• On the expressiveness and decidability of higher-order process calculi
• Contextual equivalence for higher-order pi-calculus revisited
• Foundations of Software Science and Computation Structures
• Towards `up to context' reasoning about higher-order processes

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)