An assertional criterion for atomicity

DOI10.1007/S002360200080MaRDI QIDQ1608943zbMATH OpenOpenAlexFDO

Authors W. H. Hesselink

Publication date 14 August 2002

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://pure.rug.nl/ws/files/3042571/2002ActaInfHesselink.pdf

zbMATH Keywords

mechanical theorem provertwo-writer atomic register

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)

Recommendations

• Distributed Computing
• An assertional proof for a construction of an atomic variable
• A criterion for atomicity revisited
• A criterion for atomicity
• Efficient algorithms for checking the atomicity of a run of read and write operations

Cited in

(9)

• An assertional proof for a construction of an atomic variable
• A challenge for atomicity verification
• Invariants for the construction of a handshake register
• Liveness-Preserving Atomicity Abstraction
• Splitting Atoms with Rely/Guarantee Conditions Coupled with Data Reification
• Tight failure detection bounds on atomic object implementations
• scientific article; zbMATH DE number 4096767 (Why is no real title available?)
• Distributed Computing
• A criterion for atomicity revisited

This page was built for publication: An assertional criterion for atomicity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1608943)