Model and verification of a data manager based on ARIES
In this paper, we show how to model and verify a data manager whose algorithm is based on ARIES. The work uses the I/O automata as the formal model and the definition of correctness in one that is based on the user's view of the database.
Unable to display preview. Download preview PDF.
- 1.P. Bernstein, V. Hadzilacos, and N. Goodman. Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987.Google Scholar
- 2.A. Fekete, N. Lynch, M. Merritt, and W. Weihl. Commutativity-based locking for nested transactions. Journal of Computer and System Science, 41(1):65–156, August 1990.Google Scholar
- 3.V. Hadzilacos. A theory of reliability in database systems. JACM, 35:121–145, 1988.Google Scholar
- 4.T Harder and A Reuter. Principles of transaction-oriented database recovery. ACM Computing Surveys, 15:287–317, 1983.Google Scholar
- 5.D Kuo. Model and verification of a data manager based on ARIES. Technical Report SSRC 22.1, Basser Department of Computer Science, University of Sydney, Sydney, NSW, 2006, Australia, 1992.Google Scholar
- 6.D Kuo and A Fekete. Model and verification of a data manager. Technical Report SSRC 15.1, Basser Department of Computer Science, University of Sydney, Sydney, NSW, 2006, Australia, December 1990.Google Scholar
- 7.N. Lynch and M. Tuttle. An introduction to input/output automata. CWI-Quarterly, 2(3):219–246, 1989. Also in Technical Memo MIT/LCS/TM-373, Laboratory for Computer Science Massachusettes Institute of Technology, November 1988.Google Scholar
- 8.C Mohan, D Haderle, B Lindsay, H Pirahesh, and P Schwarz. ARIES: a transaction recovery method supporting fine-granularity locking and partial rollbacks using writeahead-logging. ACM Transactions on Database Systems, 17(1):94–162, March 1992.Google Scholar
- 9.P Selinger. Chicken and eggs: The interrelationship of systems and theory. Proc. 6th ACM SIGACT-SIGMOD-SIGART symposium of Principles of Database Systems, pages 250–253, 1987.Google Scholar