86 search results - page 17 / 18 » The state of SAT |
MEMOCODE
2006
IEEE
14 years 8 days ago
2006
IEEE
We present an efficient symbolic search algorithm for software model checking. The algorithm combines multiple symbolic representations to efficiently represent the transition r...
GECCO
2004
Springer
13 years 11 months ago
2004
Springer
Genetic algorithms have been successfully applied to many difficult problems but there have been some disappointing results as well. In these cases the choice of the internal repre...
ICSE
2010
IEEE-ACM
13 years 8 months ago
2010
IEEE-ACM
The transition from single-core to multi-core processors has made multi-threaded software an important subject over the last years in computer-aided verification. Model checkers ...
POPL
2008
ACM
14 years 6 months ago
2008
ACM
Relevance heuristics allow us to tailor a program analysis to a particular property to be verified. This in turn makes it possible to improve the precision of the analysis where n...
TASE
2007
IEEE
14 years 16 days ago
2007
IEEE
Bounded model checking (BMC) based on SAT has been introduced as a complementary method to BDD-based symbolic model checking of LTL and ACTL properties in recent years. For genera...