Pages that link to "Item:Q963331"
From MaRDI portal
The following pages link to Slicing for modern program structures: a theory for eliminating irrelevant loops (Q963331):
Displayed 8 items.
- A unifying theory of control dependence and its application to arbitrary program structures (Q650921) (← links)
- Cut branches before looking for bugs: certifiably sound verification on relaxed slices (Q682366) (← links)
- Fast computation of strong control dependencies (Q832318) (← links)
- An alternative characterization of weak order dependence (Q1675759) (← links)
- A Theory of Slicing for Probabilistic Control Flow Graphs (Q2811339) (← links)
- Correctly Slicing Extended Finite State Machines (Q3297841) (← links)
- Formalizing a Framework for Dynamic Slicing of Program Dependence Graphs in Isabelle/HOL (Q3543667) (← links)
- Efficient computation of arbitrary control dependencies (Q6165552) (← links)