A serialization graph construction for nested transactions

  • Authors:

  • Alan Fekete;Nancy Lynch;William E. Weihl

  • Affiliations:

  • University of Sydney, Sydney, Australia;MIT Laboratory for Computer Science, 545 Technology Square, Cambridge, MA;MIT Laboratory for Computer Science, 545 Technology Square, Cambridge, MA

  • Venue:
  • PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
  • Year:
  • 1990

Quantified Score

Hi-index 0.00

Visualization

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.