Abstract
In this paper, we show how proper benchmarking, which matches day-to-day use of formal methods, allows us to assess direct improvements for SAT use for formal methods. Proper uses of our benchmark allowed us to prove that previous results on tuning SAT solver for Bounded Model Checking (BMC) were overly optimistic and that a simpler algorithm was in fact more efficient. © Springer-Verlag 2004.
Cite
CITATION STYLE
Zarpas, E. (2004). Simple yet efficient improvements of SAT based bounded model checking. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3312, 174–185. https://doi.org/10.1007/978-3-540-30494-4_13
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
