A Framework for Formally Verifying Software Transactional Memory Algorithms

DOI10.1007/978-3-642-32940-1_36zbMath1365.68163OpenAlexW3741743MaRDI QIDQ2912700

Victor Luchangco, Mohsen Lesani, Mark Moir

Publication date: 25 September 2012

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

Full work available at URL: https://doi.org/10.1007/978-3-642-32940-1_36

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

Mechanized proofs of opacity: a comparison of two techniques ⋮ Checking opacity and durable opacity with FDR ⋮ Unnamed Item

Uses Software

• PVS

This page was built for publication: A Framework for Formally Verifying Software Transactional Memory Algorithms