Pages that link to "Item:Q947794"
From MaRDI portal
The following pages link to Efficient SAT-based bounded model checking for software verification (Q947794):
Displaying 4 items.
- On certifying the UNSAT result of dynamic symmetry-handling-based SAT solvers (Q823775) (← links)
- Efficient SAT-based bounded model checking for software verification (Q947794) (← links)
- CPBPV: a constraint-programming framework for bounded program verification (Q968353) (← links)
- Strong extension-free proof systems (Q2303251) (← links)
