Effective Algorithms for the Satisfiability of Quantifier-Free Formulas Over Linear Real and Integer Arithmetic

By Tim King. 2014

14 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

1. Guy Katz
2. Clark W. Barrett
3. David L. Dill
4. Kyle D. Julian
5. Haniel Barbosa
6. Mykel J. Kochenderfer
7. Cesare Tinelli
8. Martin Brain

Citations in the corpus

• Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networks (2017, background): “Bound tightening operations incur overhead, and simplex implementations often use them sparsely [16].”
• cvc5: A Versatile and Industrial-Strength SMT Solver (2022, methodology): “The linear arithmetic solver [78] extends the simplex procedure adapted for SMT by Dutertre and de Moura [56].”