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. |
Year | DOI | Venue |
---|---|---|
1988 | 10.1007/3-540-50171-1_3 | ICDT |
Keywords | Field | DocType |
satisfiability,processing,transaction processing,reasoning,data bases,algorithms,coding,control theory | Atomicity,Discrete mathematics,Programming language,Correctness proofs,Computer science,Correctness,Theoretical computer science,Coding (social sciences) | Conference |
Volume | ISSN | ISBN |
326 | 0302-9743 | 0-387-50171-1 |
Citations | PageRank | References |
17 | 14.29 | 13 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Nancy A. Lynch | 1 | 10170 | 1838.61 |
Michael J. Merritt | 2 | 2156 | 412.40 |
William E. Weihl | 3 | 2614 | 903.11 |
Alan David Fekete | 4 | 1610 | 201.97 |