The following pages link to Counterexample-guided focus (Q5255078):
Displaying 10 items.
- Verification of heap manipulating programs with ordered data by extended forest automata (Q300414) (← links)
- A shape graph logic and a shape system (Q744329) (← links)
- How testing helps to diagnose proof failures (Q1624590) (← links)
- Lazy slicing for state-space exploration (Q2637297) (← links)
- Abstract Domains for Automated Reasoning about List-Manipulating Programs with Infinite Data (Q2891398) (← links)
- Counterexample Validation and Interpolation-Based Refinement for Forest Automata (Q2961572) (← links)
- Towards Complete Reasoning about Axiomatic Specifications (Q3075488) (← links)
- Predicate Abstraction for Program Verification (Q3176373) (← links)
- An Efficient Decision Procedure for Imperative Tree Data Structures (Q5200043) (← links)
- Complete instantiation-based interpolation (Q5890659) (← links)
