A criterion for atomicity revisited

DOI10.1007/S00236-007-0044-1zbMath1120.68073OpenAlexW2026417724MaRDI QIDQ884994

Wim H. Hesselink

Publication date: 7 June 2007

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00236-007-0044-1

zbMATH Keywords

gliding simulations

Mathematics Subject Classification ID

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 (5)

A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures ⋮ Simulation Refinement for Concurrency Verification ⋮ Universal extensions to simulate specifications ⋮ Simulation refinement for concurrency verification ⋮ A queue based mutual exclusion algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The existence of refinement mappings
• Concurrent reading while writing revisited
• A calculus of communicating systems
• An assertional criterion for atomicity
• 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
• Splitting forward simulations to cope with liveness
• Constructing two-writer atomic registers

This page was built for publication: A criterion for atomicity revisited