A theory of atomic transactions

Authors:
N. Lynch;M. Merritt;W. Weihl;A. Fekete
Affiliations:
M. I. T.;AT&T Bell Labs;M. I. T.;M. I. T.
Venue:
Lecture notes in computer science on ICDT '88
Year:
1988

Citing 0
Cited 3

Local atomicity properties: modular concurrency control for abstract data types

ACM Transactions on Programming Languages and Systems (TOPLAS)
A serialization graph construction for nested transactions

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A Theory of Timestamp-Based Concurrency Control for Nested Transactions

VLDB '88 Proceedings of the 14th International Conference on Very Large Data Bases

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper describes some results of a recent project to develop a theory for reasoning about atomic transactions. This theory allows careful statement of the correctness conditions to be satisfied by transaction-processing algorithms, as well as clear and concise description of such algorithms. It also serves as a framework for rigorous correctness proofs.