The paper introduces certified virtual cuts and proves per-key replay equality for wellformed DBLog runs, with all proofs machine-checked in Isabelle/HOL.
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles , series =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
A threshold-based splay rotation design for concurrent BSTs improves throughput on skewed workloads and proves static optimality for the sequential read-only case.
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.
-
Concurrent Splay-Based Tree
A threshold-based splay rotation design for concurrent BSTs improves throughput on skewed workloads and proves static optimality for the sequential read-only case.