Slicing for modern program structures: a theory for eliminating irrelevant loops
From MaRDI portal
Publication:963331
DOI10.1016/j.ipl.2007.10.002zbMath1186.68120OpenAlexW2008059658MaRDI QIDQ963331
Publication date: 19 April 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2007.10.002
programming languagesprogram slicingcompilerscontrol dependencesimulation techniquesobservable behavior
Theory of programming languages (68N15) Theory of compilers and interpreters (68N20) Theory of software (68N99)
Related Items (8)
Fast computation of strong control dependencies ⋮ An alternative characterization of weak order dependence ⋮ Efficient computation of arbitrary control dependencies ⋮ A unifying theory of control dependence and its application to arbitrary program structures ⋮ Formalizing a Framework for Dynamic Slicing of Program Dependence Graphs in Isabelle/HOL ⋮ Correctly Slicing Extended Finite State Machines ⋮ Cut branches before looking for bugs: certifiably sound verification on relaxed slices ⋮ A Theory of Slicing for Probabilistic Control Flow Graphs
Cites Work
This page was built for publication: Slicing for modern program structures: a theory for eliminating irrelevant loops
