Modular Bisimulation Theory for Computations and Values
DOI10.1007/978-3-642-37075-5_7zbMATH Open1260.68261OpenAlexW152792930WikidataQ57783394 ScholiaQ57783394MaRDI QIDQ4910414FDOQ4910414
Martin Churchill, Peter D. Mosses
Publication date: 18 March 2013
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-37075-5_7
programming languagesstructural operational semanticscongruence formatsmodular SOShigher-order bisimulation
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Cited In (8)
- Dynamic structural operational semantics
- Executable component-based semantics
- Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
- Title not available (Why is that?)
- An Axiomatic Value Model for Isabelle/UTP
- Generating Specialized Interpreters for Modular Structural Operational Semantics
- Weak Bisimulation as a Congruence in MSOS
- Flag-based big-step semantics
This page was built for publication: Modular Bisimulation Theory for Computations and Values
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4910414)
