The SMT competition 2015–2018
Abstract The International Satisfiability Modulo Theories Competition is an annual
competition between Satisfiability Modulo Theories (SMT) solvers. The 2018 edition of the …
competition between Satisfiability Modulo Theories (SMT) solvers. The 2018 edition of the …
: Satisfiability Checking Meets Symbolic Computation: (Project Paper)
Abstract Symbolic Computation and Satisfiability Checking are two research areas, both
having their individual scientific focus but sharing also common interests in the …
having their individual scientific focus but sharing also common interests in the …
Building bridges between symbolic computation and satisfiability checking
E Ábrahám - Proceedings of the 2015 ACM on International …, 2015 - dl.acm.org
The satisfiability problem is the problem of deciding whether a logical formula is satisfiable.
For first-order arithmetic theories, in the early 20th century some novel solutions in form of …
For first-order arithmetic theories, in the early 20th century some novel solutions in form of …
Fast cube tests for LIA constraint solving
M Bromberger, C Weidenbach - … , IJCAR 2016, Coimbra, Portugal, June 27 …, 2016 - Springer
We present two tests that solve linear integer arithmetic constraints. These tests are sound
and efficiently find solutions for a large number of problems. While many complete methods …
and efficiently find solutions for a large number of problems. While many complete methods …
Leveraging linear and mixed integer programming for SMT
SMT solvers combine SAT reasoning with specialized theory solvers either to find a feasible
solution to a set of constraints or to prove that no such solution exists. Linear programming …
solution to a set of constraints or to prove that no such solution exists. Linear programming …
New techniques for linear arithmetic: cubes and equalities
M Bromberger, C Weidenbach - Formal Methods in System Design, 2017 - Springer
We present several new techniques for linear arithmetic constraint solving. They are all
based on the linear cube transformation, a method presented here, which allows us to …
based on the linear cube transformation, a method presented here, which allows us to …
[图书][B] Effective algorithms for the satisfiability of quantifier-free formulas over linear real and integer arithmetic
T King - 2014 - search.proquest.com
A core technique of modern tools for formally reasoning about computing systems is
generating and dispatching queries to automated theorem provers, including Satisfiability …
generating and dispatching queries to automated theorem provers, including Satisfiability …
A collaborative framework for non-linear integer arithmetic reasoning in Alt-Ergo
S Conchon, M Iguernelala… - 2013 15th International …, 2013 - ieeexplore.ieee.org
In this paper, we describe a collaborative framework for reasoning modulo simple properties
of non-linear integer arithmetic. This framework relies on the AC (X) combination method …
of non-linear integer arithmetic. This framework relies on the AC (X) combination method …
Decision procedures for linear arithmetic
M Bromberger - 2019 - inria.hal.science
In this thesis, we present new decision procedures for linear arithmetic in the context of SMT
solvers and theorem provers: 1) CutSat++, a calculus for linear integer arithmetic that …
solvers and theorem provers: 1) CutSat++, a calculus for linear integer arithmetic that …
A non-linear arithmetic procedure for control-command software verification
P Roux, M Iguernlala, S Conchon - … on Tools and Algorithms for the …, 2018 - Springer
Abstract State-of-the-art (semi-) decision procedures for non-linear real arithmetic address
polynomial inequalities by mean of symbolic methods, such as quantifier elimination, or …
polynomial inequalities by mean of symbolic methods, such as quantifier elimination, or …