Formal Coq verification of duality between forward and backward dynamic slicing algorithms for an imperative language.
In: Proceedings of the 2015 Conference on Certified Programs and Proofs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PL 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Verified Self-Explaining Computation
Formal Coq verification of duality between forward and backward dynamic slicing algorithms for an imperative language.