Everything about C Bounded Model Checker

🧭 Start here: a 6-step reading path

1. Read the overview: C Bounded Model CheckerA 5-minute orientation
2. Pick up a classic book: Tools and Algorithms for the Construction and Analysis of SystemsThe most-reprinted book on the subject
3. Read the landmark paper: Garakabu2: an SMT-based bounded model checker for HSTM designs in ZIPCCited 6 times
4. Go sideways: Cooperating Validity CheckerA closely related topic
5. Go sideways: Satisfiability modulo theoriesA closely related topic

🏆 Landmark papers (most cited)

• Garakabu2: an SMT-based bounded model checker for HSTM designs in ZIPC

  Weiqiang Kong, Gang Hou, Xiangpei Hu · 2016 · Journal of Information Security and Applications · 6 citations

• SAT-Reach : A Bounded Model Checker for Affine Hybrid Systems

  Atanu Kundu, Sarthak Das, Rajarshi Ray · 2023 · ACM Transactions on Embedded Computing Systems · 3 citations

• A Bounded Model Checker for Timed Automata and Its Application to LTL Properties

  Kozo Okano, Maiko Onishi, Jo Otsuka · 2022 · Procedia Computer Science · 3 citations

• Using a bounded model checker for test generation: How to kill two birds with one SMT solver

  M. Petrov, K. Gagarski, M. Belyaev · 2015 · Automatic Control and Computer Sciences · 2 citations

• C Bounded Model Checker to Detect Unspecified Expression in FreeRTOS

  Department of EIE, VNR VJIET, Hyderabad, India, P. Venkata Gopi kumar · 2015 · CVR Journal of Science & Technology · 0 citations

• Using a Bounded Model Checker for Test Generation: How to Kill Two Birds with One SMT-solver

  Maxim Petrov, Kirill Gagarski, Mikhail Belyaev · 2014 · Modeling and Analysis of Information Systems · 0 citations

📚 Books worth reading

• Tools and Algorithms for the Construction and Analysis of SystemsNir Piterman · 2013
• A TOUR OF THE WORLDMalik Mansab Khan, Muhammad Rafique Abdul Aziz · 2025

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• Cooperating Validity Checker In computer science and mathematical logic, Cooperating Validity Checker (CVC) is a family of satisfiability modulo theories (SMT) solvers. The latest…
• Satisfiability modulo theories In computer science and mathematical logic, satisfiability modulo theories (SMT) is the problem of determining whether a mathematical formula is satisfiable…
• BLAST model checker The Berkeley Lazy Abstraction Software verification Tool (BLAST) is a software model checking tool for C programs. The task addressed by BLAST is the need…
• Formal methods In computer science, formal methods are mathematically rigorous techniques for the specification, development, analysis, and verification of software and…
• Constrained Horn clauses Constrained Horn clauses (CHCs) model a fragment of first-order logic with applications to program verification and synthesis. They are named after the…
• Model checking In computer science, model checking or property checking is a method for checking whether a finite-state model of a system meets a given specification…
• ETAPS International Joint Conferences on Theory and Practice of Software The ETAPS International Joint Conferences on Theory and Practice of Software (ETAPS) is a confederation of (currently) four computer science conferences…
• CPAchecker CPAchecker is a framework and tool for formal software verification, and program analysis, of C programs. Some of its ideas and concepts, for example lazy…