SMT Solving for Arithmetic Theories: Theory and Tool Support

• Published in: 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) pp. 1 - 8
• Main Authors: Abraham, Erika, Kremer, Gereon
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.09.2017
• Subjects: Algebra; Algorithms; Arithmetic; Computer aided analysis; Encoding; Logic; Planning; Product design; Semantics; Tutorials

Satisfiability checking aims to develop algorithms and tools for checking the satisfiability of logical formulas. Driven by the impressive success of SAT solvers for proposi- tional logic, Satisfiability-Modulo-Theories (SMT) solvers were developed to extend the scope also to different theories. Tod...