Decomposing Data Structure Commutativity Proofs with $m\!n$-Differencing
Abstract elided by the publisher.
Related papers
- Composing and decomposing op-based CRDTs with semidirect products ICFP 2020
- Verification of semantic commutativity conditions and inverse operations on linked data structures PLDI 2011
- Compositional Verification of Concurrent C Programs with Search Structure Templates CPP 2024
- Decomposing memory performance: data structures and phases ISMM 2006
- Verifying concurrent search structure templates PLDI 2020
- CDDiff: Semantic Differencing for Class Diagrams ECOOP 2011
- Refinement for Structured Concurrent Programs CAV 2020
- Symbolic Finite Differencing - Part I ESOP 1990