The paper introduces certified virtual cuts and proves per-key replay equality for wellformed DBLog runs, with all proofs machine-checked in Isabelle/HOL.
The existence of refinementmappings.TheoreticalComputerScience,82 (2):253–284, 1991
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Theoretical Study of DBLog: Certified Virtual Cuts for a Snapshot-Equivalent Replay of Live Databases
The paper introduces certified virtual cuts and proves per-key replay equality for wellformed DBLog runs, with all proofs machine-checked in Isabelle/HOL.