Parameterized concurrent program safety over topologies reduces to complete local compositional proofs via universally quantified inductive invariants.
In: Proceedings of the 41st ACM SIGPLAN Conference on Programming Language Design and Imple- mentation, pp
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Complete Local Reasoning About Parameterized Programs Over Topologies
Parameterized concurrent program safety over topologies reduces to complete local compositional proofs via universally quantified inductive invariants.