A framework for formally verifying software transactional memory algorithms

Authors:
Mohsen Lesani;Victor Luchangco;Mark Moir
Affiliations:
University of California, Los Angeles;Oracle Labs, Burlington, MA;Oracle Labs, Burlington, MA
Venue:
CONCUR'12 Proceedings of the 23rd international conference on Concurrency Theory
Year:
2012

Citing 13
Cited 1

Hierarchical correctness proofs for distributed algorithms

PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Transactional memory: architectural support for lock-free data structures

ISCA '93 Proceedings of the 20th annual international symposium on computer architecture
Forward and backward simulations I.: untimed systems

Information and Computation
The serializability of concurrent database updates

Journal of the ACM (JACM)
PVS: A Prototype Verification System

CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Verifying Correctness of Transactional Memories

FMCAD '07 Proceedings of the Formal Methods in Computer Aided Design
On the correctness of transactional memory

Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming
Model checking transactional memories

Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
Mechanical Verification of Transactional Memories with Non-transactional Memory Accesses

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
NOrec: streamlining STM by abolishing ownership records

Proceedings of the 15th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
PVS Strategies for Proving Abstraction Properties of Automata

Electronic Notes in Theoretical Computer Science (ENTCS)
Parameterized verification of transactional memories

PLDI '10 Proceedings of the 2010 ACM SIGPLAN conference on Programming language design and implementation
Transactional locking II

DISC'06 Proceedings of the 20th international conference on Distributed Computing

WTTM 2012, the fourth workshop on the theory of transactional memory

ACM SIGACT News

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a framework for verifying transactional memory (TM) algorithms. Specifications and algorithms are specified using I/O automata, enabling hierarchical proofs that the algorithms implement the specifications. We have used this framework to develop what we believe is the first fully formal machine-checked verification of a practical TM algorithm: the NOrec algorithm of Dalessandro, Spear and Scott. Our framework is available for others to use and extend. New proofs can leverage existing ones, eliminating significant work and complexity.