Automatic Mutual Exclusion and Atomicity Checks
- Martin Abadi
Concurrency, Graphs and Models |
Published by Springer
This paper provides an introduction to the Automatic Mutual Exclusion (AME) programming model and to its formal study, through the AME calculus. AME resembles cooperative multithreading; in the intended implementations, however, software transactional memory supports the concurrent execution of atomic fragments. This paper also studies simple dynamic and static mechanisms for atomicity checks in AME.