CV-rules equivalently characterize serializability via explicit orders satisfying C-rule and V-rule, used to verify five protocols including SSN and Aria with Lean mechanization of most results.
A Framework for Formally Verifying Software Transactional Memory Algorithms
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Viability games on valence systems over graph monoids admit a complete decidability and complexity classification, with decidable cases in pushdown-counter combinations where non-termination games remain undecidable.
Position graphs formalize relative positions via two strict partial orders with chain and compatibility constraints, and induced subgraph isomorphism for structural patterns remains NP-complete in this class.
citing papers explorer
-
CV-Rules: Serializability Verification of Concurrency Control Protocols via Explicit Transaction Ordering
CV-rules equivalently characterize serializability via explicit orders satisfying C-rule and V-rule, used to verify five protocols including SSN and Aria with Lean mechanization of most results.
-
Infinite-state Games with Energy Objectives Beyond Counters
Viability games on valence systems over graph monoids admit a complete decidability and complexity classification, with decidable cases in pushdown-counter combinations where non-termination games remain undecidable.
-
Position Spaces and Graphs
Position graphs formalize relative positions via two strict partial orders with chain and compatibility constraints, and induced subgraph isomorphism for structural patterns remains NP-complete in this class.