LCS Publication Details
Publication Title: NESTED TRANSACTIONS AND READ/WRITE LOCKING
Publication Author: Fekete, Alan
Additional Authors: Lynch, Nancy, Merritt, Michael and Weihl, William
LCS Document Number: MIT-LCS-TM-324
Publication Date: 4-1-1987
LCS Group: No Group Specified
Additional URL: No URL Given
Abstract:
We give a clear yet rigorous correctness proof for Moss's algorithm for managing data in a nested transaction system. Algorithm, which is the basis of concurrency control and recovery in the Argus system, uses read-and write-locks ans a stack of versions of each object to ensure the serializability and recoverability of transaction accessing the data. Our proof extends earlier work on exclusive locking to prove that Moss's algorithm generates serially correct executions in the presence of concurrency and transaction aborts.
To obtain this publication:

To purchase a printed copy of this publication please contact MIT Document Services.