We are experiencing minor difficulties with our submission forms, which we are working to resolve. If you have any issues while submitting items, please contact us at dspace-lib@mit.edu.

Concurrency Control for Resilient Nested Transaction

Thumbnail Image
Download
Name

MIT-LCS-TR-285.pdf

Size

1.76 MB

Format

Adobe PDF

Checksum (MD5)

6f955a4945baafa249a3f9e213da34f3

Author(s)
Lynch, Nancy A.
Date Issued
May 1985
Series/Report no.
MIT-LCS-TR-285
Abstract
Concurrency control theory is extended to handle nested transactions with failures. The theory is used to present a rigorous correctness proof of a variant of Moss' locking algorithm for implementing nested transactions. The proof has an interesting structure using many levels of abstraction.
Persistent DSpace Link
PrivacyPermissionsAccessibilityContact us
Notify us about copyright concerns.