Designing a semantic model for a wide-spectrum language with concurrency
From MaRDI portal
Publication:1682288
DOI10.1007/s00165-017-0416-4zbMath1375.68036arXiv1609.00195OpenAlexW2963544244MaRDI QIDQ1682288
Robert J. Colvin, Larissa A. Meinicke, Ian J. Hayes
Publication date: 29 November 2017
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.00195
Theory of programming languages (68N15) Semantics in the theory of computing (68Q55) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (5)
A synchronous program algebra: a basis for reasoning about shared-memory and event-based concurrency ⋮ A fine-grained semantics for arrays and pointers under weak memory models ⋮ Unifying theories of reactive design contracts ⋮ Encoding fairness in a synchronous concurrent program algebra ⋮ A wide-spectrum language for verification of programs on weak memory models
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalised rely-guarantee concurrency: an algebraic foundation
- Concurrent Kleene algebra and its foundations
- A semantics for concurrent separation logic
- Balancing expressiveness in formal approaches to concurrency
- A refinement calculus for shared-variable parallel and distributed programming
- A structural approach to operational semantics
- Towards a refinement algebra
- Full abstraction for a shared-variable parallel language
- Isabelle/UTP: A Mechanised Theory Engineering Framework
- Tentative steps toward a development method for interfering programs
- Refinement Calculus
- The specification statement
- A Structural Proof of the Soundness of Rely/guarantee Rules
- An axiomatic basis for computer programming
This page was built for publication: Designing a semantic model for a wide-spectrum language with concurrency
