Decision Procedures for the Grand Challenge [chapter]

Daniel Kroening
2008 Lecture Notes in Computer Science  
The Verifying Compiler checks the correctness of the program it compiles. The workhorse of such a tool is the reasoning engine, which decides validity of formulae in a suitably chosen logic. This paper discusses possible choices for this logic, and how to solve the resulting decision problems. A framework for reducing decision problems to propositional logic is described, which allows the surprising improvements in the performance of propositional SAT solvers to be exploited. The only
more » ... the framework makes is that an axiomatization of the desired logic is given.
doi:10.1007/978-3-540-69149-5_46 fatcat:yi7stktfv5ewtpvl2726khnwme