SMT Solving for Arithmetic Theories: Theory and Tool Support

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...

Full description

Saved in:
Bibliographic Details
Published in2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC) pp. 1 - 8
Main Authors Abraham, Erika, Kremer, Gereon
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.09.2017
Subjects
Algebra
Algorithms
Arithmetic
Computer aided analysis
Encoding
Logic
Planning
Product design
Semantics
Tutorials
Online AccessGet full text

Cover

More Information
Summary: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. Today, SMT solving is widely used in many applications, for example verification, synthesis, planning or product design automation. In this tutorial paper we give a short introduction to the foundations of SMT solving, describe some popular SMT solvers and illustrate their usage. We also present our own solver SMT-RAT, which was developed to support the strategic combination of different decision procedures, putting a focus on arithmetic theories.
DOI:10.1109/SYNASC.2017.00009