Comparing SAT encodings for model checking

DOI10.1007/3-540-45578-7_82MaRDI QIDQ4735931zbMATH OpenFDO

Authors Daniel Sheridan

Publication date 9 August 2004

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2239/22390784.htm

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

• Tuning SAT checkers for bounded model checking
• Theory and Applications of Models of Computation
• Improving the encoding of LTL model checking into SAT
• A fixpoint based encoding for bounded model checking
• Accelerating bounded model checking of safety properties

Cited in

(8)

• Optimized SAT encoding of conformance checking artefacts
• Tuning SAT checkers for bounded model checking
• Encoding RTL constructs for \textsc{MathSAT}: a preliminary report
• Compressing BMC encodings with QBF
• Encoding OCL data types for SAT-based verification of UML/OCL models
• Improving the encoding of LTL model checking into SAT
• scientific article; zbMATH DE number 5051652 (Why is no real title available?)
• Encoding Queues in Satisfiability Modulo Theories Based Bounded Model Checking

This page was built for publication: Comparing SAT encodings for model checking

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