Design and performance of an assertional concurrency control system

Bernstein, Arthur J.; Leung, W.H.; Gerstl, David S.; Lewis, Philip

doi:10.1109/icde.1998.655806

Cited by 5 publications

(1 citation statement)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Examples include (but are not limited to), consistency requirements (i.e., a method/transaction has to preserve a number of static integrity constraints) [4], the correctness of undo methods (i.e., for each method another method has to be specified which compensates the effects of the method) [9], and commutativity tables (i.e., for each method pair, it has to be specified when two methods commute) [17]. Such knowledge about the semantics of a schema is used by so-called advanced transaction models to provide more flexible mechanisms for concurrency control [12].…”

Section: Introductionmentioning

confidence: 99%

A Theorem Prover-Based Analysis Tool for Object-Oriented Databases

Spelt

Even

1999

Tools and Algorithms for the Construction and Analysis of Systems

View full text Add to dashboard Cite

Abstract. We present a theorem-prover based analysis tool for object-oriented database systems with integrity constraints. Object-oriented database specifications are mapped to higher-order logic (HOL). This allows us to reason about the semantics of database operations using a mechanical theorem prover such as Isabelle or PVS. The tool can be used to verify various semantics requirements of the schema (such as transaction safety, compensation, and commutativity) to support the advanced transaction models used in workflow and cooperative work. We give an example of method safety analysis for the generic structure editing operations of a cooperative authoring system.

show abstract

Section: Introductionmentioning

confidence: 99%