Simulation Refinement for Concurrency Verification
From MaRDI portal
Publication:5403461
DOI10.1016/j.entcs.2008.06.002zbMath1283.68207OpenAlexW4230510488MaRDI QIDQ5403461
Publication date: 26 March 2014
Published in: Electronic Notes in Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.entcs.2008.06.002
Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The existence of refinement mappings
- Lock-free parallel and concurrent garbage collection by mark\&sweep
- A general lock-free algorithm using compare-and-swap
- A criterion for atomicity revisited
- On interprocess communication. II: Algorithms
- An assertional proof for a construction of an atomic variable
- Using eternity variables to specify and prove a serializable database interface
- Forward and backward simulations. I. Untimed Systems
- Universal extensions to simulate specifications
- A challenge for atomicity verification
- Splitting forward simulations to cope with liveness
- Refinement verification of the lazy caching algorithm
- Reduction
- Eternity variables to prove simulation of specifications
- Computer Aided Verification
This page was built for publication: Simulation Refinement for Concurrency Verification
