Add to ORKGThis paper describes ome 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.
Abstract: "Atomic transactions are a widely-accepted technique for organizing computation in fault-t...
Atomic systems, that is, sets of rules containing only atomic formulas, play an important role in pr...
We present applications of the recently proposed Transaction Logic---an extension of classical logic...
Atomic transactions are a widely-accepted technique for organizing activities in reliable distribute...
We present a new model for describing and reasoning about transaction-processing algorithms. The mod...
Object-oriented programming languages provide transaction behavior by means of library classes. In e...
Relaxing the isolation requirements on transactions leads to systems in which transactions can now c...
159 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1985.The concept of an indivisible...
An extension of predicate logic, called Transaction Logic, is proposed, which accounts in a clean an...
We present a proof calculus and method for the static verification of assertions and procedure speci...
AbstractWe present a new model for describing and reasoning about transaction-processing algorithms....
Transactions are commonly described as being ACID: All-or-nothing, Consistent, Isolated and Durable....
Using the fiction of atomicity as a design abstraction and then refining atomicity as we develop an ...
Most proof methods for reasoning about concurrent programs are based upon the interleaving semantics...
We present a general theory of serializability, unifying a wide range of transactional algorithms, i...
Abstract: "Atomic transactions are a widely-accepted technique for organizing computation in fault-t...
Atomic systems, that is, sets of rules containing only atomic formulas, play an important role in pr...
We present applications of the recently proposed Transaction Logic---an extension of classical logic...
Atomic transactions are a widely-accepted technique for organizing activities in reliable distribute...
We present a new model for describing and reasoning about transaction-processing algorithms. The mod...
Object-oriented programming languages provide transaction behavior by means of library classes. In e...
Relaxing the isolation requirements on transactions leads to systems in which transactions can now c...
159 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1985.The concept of an indivisible...
An extension of predicate logic, called Transaction Logic, is proposed, which accounts in a clean an...
We present a proof calculus and method for the static verification of assertions and procedure speci...
AbstractWe present a new model for describing and reasoning about transaction-processing algorithms....
Transactions are commonly described as being ACID: All-or-nothing, Consistent, Isolated and Durable....
Using the fiction of atomicity as a design abstraction and then refining atomicity as we develop an ...
Most proof methods for reasoning about concurrent programs are based upon the interleaving semantics...
We present a general theory of serializability, unifying a wide range of transactional algorithms, i...
Abstract: "Atomic transactions are a widely-accepted technique for organizing computation in fault-t...
Atomic systems, that is, sets of rules containing only atomic formulas, play an important role in pr...
We present applications of the recently proposed Transaction Logic---an extension of classical logic...