ACM Transactions on Database Systems · 1996 · 25 citations · 6 references
ComputingComputer ScienceComputer SystemsAlgorithmsData ManagementFormal MethodsAutomata TheoryDeductive VerificationFinite AutomataFinite State Machine ModelingFinite-state MachinesModel CheckingAutomata In Formal VerificationFinite State Machine VerificationState Machine ModelsTransition Systems
In this article, we model and verify a data manager whose algorithm is based on ARIES. The work uses the I/O automata method as the formal model and the definition of correctness is defined on the interface between the scheduler and the data manager.
6
C. Mohan, Don Haderle, Bruce G. Lindsay et al. · ACM Transactions on Database Systems · 1992 · 1K citations · Full text
An Introduction to Input/Output Automata
Nancy Lynch, Mark R. Tuttle · Formal Aspects of Computing · 2026 · 1K citations · Full text
Hierarchical correctness proofs for distributed algorithms
Nancy Lynch, Mark R. Tuttle · 1987 · 767 citations · Full text
A theory of reliability in database systems
Vassos Hadzilacos · Journal of the ACM · 1988 · 112 citations · Full text
Commutativity-based locking for nested transactions
Alan Fekete, Nancy Lynch, Michael Merritt et al. · Journal of Computer and System Sciences · 1990 · 46 citations