Sciweavers

16 search results - page 4 / 4
» cade 2002
Sort
View
CADE
2002
Springer
14 years 5 months ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
Harald Rueß, Leonardo Mendonça de Mou...