Satisfiability Checking满足能力的检验.pdfVIP

Satisfiability Checking: Theory and Applications B ´ ( ) Erika Abrah´am and Gereon Kremer RWTH Aachen University, Aachen, Germany abraham@cs.rwth-aachen.de Abstract. Satisfiability checking aims to develop algorithms and tools for checking the satisfiability of existentially quantified logical formu- las. Besides powerful SAT solvers for solving propositional logic formu- las, sophisticated SAT-modulo-theories (SMT) solvers are available for a wide range of theories, and are applied as black-box engines for many techniques in different areas. In this paper we give a short introduction to the theoretical foundations of satisfiability checking, mention some of the most popular tools, and discuss the successful embedding of SMT solvers in different technologies. 1 Introduction First-order-logic is a powerful modelling formalism frequently used to specify problems in different areas like verification, termination analysis, test case gen- eration, controller synthesis, equivalence checking, combinatorial tasks, schedul- ing, planning, and product design automation and optimisation, just to mention a few well-known examples. Once the problem is formalised, algorithms and their implementations are needed to check the validity or satisfiability of the formulas, and in case they are satisfiable, to identify satisfying solutions. Algorithms to solve this problem are called decision procedures. In mathematical logic, in the early 20th century some novel decision pro- cedures were developed for arithmetic theories. With the advent of computer systems, big efforts were made to provide automated solutions in form of prac- ticall