110 search results - page 15 / 22 » Tuning SAT Checkers for Bounded Model Checking |
SPIN
2007
Springer
14 years 3 months ago
2007
Springer
Boolean programs are frequently used to model abstractions of software programs. They have the advantage that reachability properties are decidable, despite the fact that their sta...
VLSID
2004
IEEE
14 years 9 months ago
2004
IEEE
This paper presents a novel technique for abstracting designs in order to increase the efficiency of formal property checking. Bounded Model Checking (BMC), using Satisfiability (...
ECOOPW
1999
Springer
14 years 1 months ago
1999
Springer
The model checking of applications of aspects is explained, by showing the stages and proof obligations when a collection of generic aspects (called a superimposition) is combined...
ECAI
2008
Springer
13 years 11 months ago
2008
Springer
Abstract. We propose a SAT-based algorithm for incremental diagnosis of discrete-event systems. The monotonicity is ensured by a prediction window that uses the future observations...
VLSID
2010
IEEE
13 years 7 months ago
2010
IEEE
Directed test generation is important for the functional verification of complex system-on-chip designs. SAT based bounded model checking is promising for counterexample generatio...