Concurrency Control for Resilient Nested Transaction
| dc.contributor.author | Lynch, Nancy A. | en_US |
| dc.date.accessioned | 2023-03-29T15:07:09Z | |
| dc.date.available | 2023-03-29T15:07:09Z | |
| dc.date.issued | 1983-02 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149563 | |
| dc.description.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. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TR-285 | |
| dc.title | Concurrency Control for Resilient Nested Transaction | en_US |
| dc.identifier.oclc | 10160353 |
