A challenge for atomicity verification

DOI10.1016/J.SCICO.2008.01.001MaRDI QIDQ2482021zbMATH OpenOpenAlexFDO

Authors W. H. Hesselink

Publication date 16 April 2008

Published in Science of Computer Programming (Search for Journal in Brave)

Full work available at URL https://pure.rug.nl/ws/files/2756022/2008SciCompProgHesselink.pdf

zbMATH Keywords

atomicityrefinementregular variablessafe variablestheorem proving

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• An assertional proof for a construction of an atomic variable
• An assertional criterion for atomicity
• A criterion for atomicity revisited
• Distributed Computing
• Verifying atomic data types

Cited in

(8)

• An assertional proof for a construction of an atomic variable
• Tight failure detection bounds on atomic object implementations
• Simulation Refinement for Concurrency Verification
• Simulation refinement for concurrency verification
• Nonatomic dual bakery algorithm with bounded tokens
• A criterion for atomicity revisited
• Verifying atomic data types
• A note on atomicity: boosting Test\&Set to solve consensus

Describes a project that uses

Uses Software

• PVS

This page was built for publication: A challenge for atomicity verification

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