Pages that link to "Item:Q650921"
From MaRDI portal
The following pages link to A unifying theory of control dependence and its application to arbitrary program structures (Q650921):
Displaying 17 items.
- 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)
- The dependence condition graph: precise conditions for dependence between program points (Q1749251) (← links)
- Control structures in programs and computational complexity (Q1772780) (← links)
- Simple and efficient computation of minimal weak control closure (Q2233536) (← links)
- A Theory of Slicing for Probabilistic Control Flow Graphs (Q2811339) (← links)
- Control flow graphs and code coverage (Q3083920) (← links)
- Widening with Thresholds for Programs with Complex Control Graphs (Q3172939) (← links)
- Correctly Slicing Extended Finite State Machines (Q3297841) (← links)
- A UNIFORM APPROACH TO CONTROL FLOW GRAPHS OF PROGRAMS (Q3459810) (← links)
- (Q3748915) (← links)
- (Q4428295) (← links)
- (Q4461750) (← links)
- Abstract Program Slicing (Q5278199) (← links)
- Programming Languages and Systems (Q5316585) (← links)
- Efficient computation of arbitrary control dependencies (Q6165552) (← links)