Formal Coq verification of duality between forward and backward dynamic slicing algorithms for an imperative language.
Science of Computer Programming 62(3), 228–252 (2006), special issue on Source code analysis and manipulation (SCAM 2005)
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.