DMCA
Moir: A Framework for Formally Verifying Software Transactional Memory Algorithms
| Venue: | In Proceedings of the 23rd International Conference on Concurrency Theory, CONCUR 2012 |
| Citations: | 7 - 5 self |
BibTeX
@INPROCEEDINGS{Lesani_moir:a,
author = {Mohsen Lesani and Victor Luchangco and Mark Moir},
title = {Moir: A Framework for Formally Verifying Software Transactional Memory Algorithms},
booktitle = {In Proceedings of the 23rd International Conference on Concurrency Theory, CONCUR 2012},
year = {},
pages = {516--530}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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. 1
