Using timestamping and history variables to verify sequential consistency

DOI10.1007/3-540-44585-4_42MaRDI QIDQ4551176zbMATH OpenFDO

Authors Tamarah Arons

Publication date 4 September 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2102/21020423

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Computing methodologies and applications (68U99)

Recommendations

• Refinement verification of the lazy caching algorithm
• Verifying sequential consistency on shared-memory multiprocessor systems
• Using CSP to verify sequential consistency
• Automatable verification of sequential consistency
• Characterization of a sequentially consistent memory and verification of a cache memory by abstraction

Cited in

(3)

• Refinement verification of the lazy caching algorithm
• Sequentialization using timestamps
• Using CSP to verify sequential consistency

This page was built for publication: Using timestamping and history variables to verify sequential consistency

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