Benchmarking SAT solvers for bounded model checking

DOI10.1007/11499107_25MaRDI QIDQ5713723zbMATH OpenOpenAlexFDO

Authors E. Zarpas

Publication date 15 December 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b137280

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Anatomy and empirical evaluation of modern SAT solvers
• Empirical study of the anatomy of modern SAT solvers
• Statistical methodology for comparison of SAT solvers
• Formal Methods in Computer-Aided Design
• scientific article; zbMATH DE number 5605058

Cited in

(9)

• A subset-matching size-bounded cache for testing satisfiability in modal logics
• SpyBug: automated bug detection in the configuration space of SAT solvers
• scientific article; zbMATH DE number 5139172 (Why is no real title available?)
• Improvements to Hybrid Incremental SAT Algorithms
• Algorithm runtime prediction: methods \& evaluation
• Automated testing and debugging of SAT and QBF solvers
• Statistical methodology for comparison of SAT solvers
• The configurable SAT solver challenge (CSSC)
• Theory and Applications of Models of Computation

Describes a project that uses

Uses Software

• Chaff
• BerkMin
• Zchaff2004

This page was built for publication: Benchmarking SAT solvers for bounded model checking

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5713723)