Parameterized concurrent program safety over topologies reduces to complete local compositional proofs via universally quantified inductive invariants.
In: Proceedings of the 33rd ACM SIGPLAN Confer- ence on Programming Language Design and Implementation
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Refinements to error-free transformations plus residue override reduce false reports in floating-point residue computation on most tested benchmarks.
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.
-
Accurate Residues for Floating-Point Debugging
Refinements to error-free transformations plus residue override reduce false reports in floating-point residue computation on most tested benchmarks.