Name
Abstract | ||
|---|---|---|
This paper makes three contributions. First, we present a proof technique that offers system designers the same ease of reasoning about nested transaction systems as is given by the classical theory for systems without nesting, and yet can be used to verify that a system satisfies the robust “user view” definition of correctness of [10]. Second, as applications of the technique, we verify the correctness of Moss' read/write locking algorithm for nested transactions, and of an undo logging algorithm that has not previously been presented or proved for nested transaction systems. Third, we make explicit the assumptions used for this proof technique, assumptions that are usually made implicitly in the classical theory, and therefore we clarify the type of system for which the classical theory itself can reliably be used. |
Year | DOI | Venue |
|---|---|---|
1990 | 10.1145/298514.298547 | PODS |
Keywords | Field | DocType |
user view,nested transaction,proof technique,classical theory,nested transaction system,serialization graph construction,system designer,graphs,algorithms,sequences,satisfiability,system design,systems engineering,construction,reasoning | Graph,Undo,Programming language,Serialization,Computer science,Correctness,As is,Theoretical computer science,Nested transaction | Conference |
ISBN | Citations | PageRank |
0-89791-352-3 | 26 | 12.20 |
References | Authors | |
14 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Alan David Fekete | 1 | 1610 | 201.97 |
| Nancy A. Lynch | 2 | 10170 | 1838.61 |
| William E. Weihl | 3 | 2614 | 903.11 |