Completeness of fair ASM refinement
From MaRDI portal
Publication:541210
DOI10.1016/j.scico.2009.10.004zbMath1217.68065OpenAlexW2005957990MaRDI QIDQ541210
Publication date: 6 June 2011
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.scico.2009.10.004
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items (2)
A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures ⋮ ASM specification and refinement of a quantum algorithm
Uses Software
Cites Work
- ASM refinement and generalizations of forward simulation in data refinement: a comparison
- The ASM refinement method
- The existence of refinement mappings
- Proving correctness with respect to nondeterministic safety specifications
- Power domains
- Relation-algebraic semantics
- Forward and backward simulations. I. Untimed Systems
- Universal extensions to simulate specifications
- Splitting forward simulations to cope with liveness
- Interactive verification of concurrent systems using symbolic execution
- Programs, Recursion and Unbounded Choice
- Abstract State Machines
- Data Refinement
- Evolving Algebras 1993: Lipari Guide
- A theory of normed simulations
- Eternity variables to prove simulation of specifications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Completeness of fair ASM refinement
