110 search results - page 11 / 22 » Tuning SAT Checkers for Bounded Model Checking |
TABLEAUX
2007
Springer
14 years 3 months ago
2007
Springer
Abstract. Model checking is a technique for verifying that a finite-state concurrent system is correct with respect to its specification. In bounded model checking (BMC), the sys...
ATAL
2005
Springer
14 years 2 months ago
2005
Springer
We present an approach to the verification of temporal epistemic properties in synchronous multi-agent systems (MAS) via bounded model checking (BMC). Based on the semantics of s...
CAV
2006
Springer
14 years 27 days ago
2006
Springer
Many multithreaded programs employ concurrent data types to safely share data among threads. However, highly-concurrent algorithms for even seemingly simple data types are difficul...
ICONS
2008
IEEE
14 years 3 months ago
2008
IEEE
In this paper we describe the complete workflow of analyzing the dynamic behavior of safety-critical embedded systems with HySAT. HySAT is an arithmetic constraint solver with a ...
KBSE
2007
IEEE
14 years 3 months ago
2007
IEEE
A number of researchers have proposed the use of Boolean satisfiability solvers for verifying C programs. They encode correctness checks as Boolean formulas using finitization: ...