The following pages link to (Q4427894):
Displaying 10 items.
- An efficient approach for abstraction-refinement in model checking (Q690465) (← links)
- Efficient SAT-based bounded model checking for software verification (Q947794) (← links)
- Partial predicate abstraction and counter-example guided refinement (Q2291815) (← links)
- Compositional SCC analysis for language emptiness (Q2505627) (← links)
- A satisfiability-based approach to abstraction refinement in model checking (Q2845512) (← links)
- Interpolant learning and reuse in SAT-based model checking (Q2864382) (← links)
- Abstraction-Based Algorithm for 2QBF (Q3007686) (← links)
- Abstraction and Abstraction Refinement (Q3176371) (← links)
- Theory and Applications of Satisfiability Testing (Q5325852) (← links)
- Automated Technology for Verification and Analysis (Q5394185) (← links)