SAT Modulo Linear Arithmetic for Solving Polynomial Constraints

  title={SAT Modulo Linear Arithmetic for Solving Polynomial Constraints},
  author={Cristina Borralleras and Salvador Lucas and Albert Oliveras and Enric Rodr{\'i}guez-Carbonell and Albert Rubio},
  journal={Journal of Automated Reasoning},
Polynomial constraint solving plays a prominent role in several areas of hardware and software analysis and verification, e.g., termination proving, program invariant generation and hybrid system verification, to name a few. In this paper we propose a new method for solving non-linear constraints based on encoding the problem into an SMT problem considering only linear arithmetic. Unlike other existing methods, our method focuses on proving satisfiability of the constraints rather than on… CONTINUE READING
Highly Cited
This paper has 42 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 27 extracted citations


Publications referenced by this paper.
Showing 1-10 of 46 references

The Satisfiability Modulo Theories Library (SMT-LIB)

  • C. Barrett, S. Ranise, A. Stump, C. Tinelli
  • 2008
Highly Influential
8 Excerpts

An Efficient SMT Solver. In Proceedings of the 14th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS’08

  • L. de Moura, Z N.Björner.
  • Lecture Notes in Computer Science,
  • 2008
1 Excerpt

Similar Papers

Loading similar papers…