Abstract
One of the most important industrial applications of SAT is currently Bounded Model Checking (BMC). This technique is typically used for formal hardware verification in the context of Electronic Design Automation. But BMC has successfully been applied to many other domains as well. In practice, BMC is mainly used for falsification, which is concerned with violations of temporal properties. In addition, a considerable part of this chapter discusses complete extensions, including k-induction and interpolation. These extensions also allow to prove properties.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Integrating Loop Acceleration Into Bounded Model Checking;Lecture Notes in Computer Science;2024-09-11
2. JCWIT: A Correctness-Witness Validator for Java Programs Based on Bounded Model Checking;Proceedings of the 33rd ACM SIGSOFT International Symposium on Software Testing and Analysis;2024-09-11
3. Towards Better SAT Encodings for Hash Function Inversion Problems;2024 47th MIPRO ICT and Electronics Convention (MIPRO);2024-05-20
4. Certifying Phase Abstraction;Lecture Notes in Computer Science;2024
5. Impact of Satisfiability Solvers on Logic Locking;Understanding Logic Locking;2023-09-23