Completeness and Nondeterminism in Model Checking Transactional Memories

DOI10.1007/978-3-540-85361-9_6zbMath1160.68441OpenAlexW1761177680MaRDI QIDQ3541009

Vasu Singh, Thomas A. Henzinger, Rachid Guerraoui

Publication date: 25 November 2008

Published in: CONCUR 2008 - Concurrency Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85361-9_6

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (7)

Model checking transactional memories ⋮ Perspectives on Transactional Memory ⋮ Mechanized proofs of opacity: a comparison of two techniques ⋮ Verification of STM on relaxed memory models ⋮ Permissiveness in Transactional Memories ⋮ Towards formally specifying and verifying transactional memory ⋮ Extensible transactional memory testbed

Cites Work

• Model checking transactional memories
• The serializability of concurrent database updates
• Software transactional memory
• Antichains: A New Algorithm for Checking Universality of Finite Automata

This page was built for publication: Completeness and Nondeterminism in Model Checking Transactional Memories