Parameterized concurrent program safety over topologies reduces to complete local compositional proofs via universally quantified inductive invariants.
Information Processing Letters22(6), 307–309 (1986)
2 Pith papers cite this work, alongside 274 external citations. Polarity classification is still indexing.
2
Pith papers citing it
274
external citations · Crossref
fields
cs.LO 2years
2026 2representative 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.
- Verification of Configurable SRA Systems