Transactional Memory: Glimmer of a Theory

DOI10.1007/978-3-642-02658-4_1zbMath1242.68056OpenAlexW1830477019MaRDI QIDQ3636851

Michał Kapałka, Rachid Guerraoui

Publication date: 30 June 2009

Published in: Computer Aided Verification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-02658-4_1

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Related Items (6)

Defining and Verifying Durable Opacity: Correctness for Persistent Software Transactional Memory ⋮ \(\mathrm {TM}^{2}\mathrm {C}\): a software transactional memory for many-cores ⋮ Mechanized proofs of opacity: a comparison of two techniques ⋮ Proving opacity of transactional memory with early release ⋮ Towards formally specifying and verifying transactional memory ⋮ Verifying Opacity of a Transactional Mutex Lock

This page was built for publication: Transactional Memory: Glimmer of a Theory