College of Engineering >
Computer Science >
Computer Science Technical Reports >
Please use this identifier to cite or link to this item:
|Title: ||An Assertional Characterization of Serializability|
|Authors: ||McCurley, E. Robert|
Schneider, Fred B.
|Keywords: ||computer science|
|Issue Date: ||Sep-1989|
|Publisher: ||Cornell University|
|Abstract: ||Serializability is usually defined operationally in terms of sequences of operations. This paper gives another definition of serializability-in terms of sequences of states. It also shows how this definition can be used to prove correctness of solutions to the concurrency control problem.|
|Appears in Collections:||Computer Science Technical Reports|
Items in eCommons are protected by copyright, with all rights reserved, unless otherwise indicated.