The following pages link to Programming Languages and Systems (Q5316585):
Displaying 11 items.
- Automated debugging based on a constraint model of the program and a test case (Q444487) (← links)
- 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)
- A trajectory-based strict semantics for program slicing (Q960858) (← links)
- Slicing for modern program structures: a theory for eliminating irrelevant loops (Q963331) (← links)
- Slicing for architectural analysis (Q988166) (← links)
- Slicing communicating automata specifications: Polynomial algorithms for model reduction (Q1019005) (← links)
- An alternative characterization of weak order dependence (Q1675759) (← links)
- Simple and efficient computation of minimal weak control closure (Q2233536) (← links)
- Correctly Slicing Extended Finite State Machines (Q3297841) (← links)