A separation-logic technique enables modular, SMT-based verification of reachability properties for DAGs and 0-1-path graphs using relatively convex footprints.
The dire ct update formulas provide a canonical form of the reachability relation in the new state (e
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PL 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Modular Verification of Heap Reachability Properties in Separation Logic
A separation-logic technique enables modular, SMT-based verification of reachability properties for DAGs and 0-1-path graphs using relatively convex footprints.