On using floating-point computations to help an exact linear arithmetic decision procedure

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5643 LNCS, Issue , 2009, Pages 570-583

  Monniaux, David ^a  

^a VERIMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DECISION PROBLEMS; DECISION PROCEDURE; FLOATING-POINT COMPUTATION; LINEAR ARITHMETIC; LINEAR INEQUALITIES; OTHER APPLICATIONS; PREPROCESSING PHASE; PROGRAM ANALYSIS; RATIONAL NUMBERS; SAT SOLVERS; SATISFIABILITY MODULO THEORIES; TEST CASE;

COMPUTER AIDED ANALYSIS; DECISION THEORY; DIGITAL ARITHMETIC;

MODEL CHECKING;

EID: 70350223974     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02658-4_42     Document Type: Conference Paper

References (15)

1. Applegate, D., Cook, W., Dash, S., Espinoza, D.: Exact solutions to linear programming problems. Oper. Res. Lett. 35(6), 693-699 (2007)
2. Dantzig, G.: Linear Programming and Extensions. Princeton University Press, Princeton (1998)
3. de Moura, L., Bjørner, N.: Z3: An efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337-340. Springer, Heidelberg (2008)
4. Dhiflaoui, M., Funke, S., Kwappik, C., Mehlhorn, K., Seel, M., Schömer, E., Schulte, R., Weber, D.: Certifying and repairing solutions to large LPs: how good are LP-solvers? In: SODA 2003: Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 255-256. SIAM, Philadelphia (2003)
5. Dutertre, B., de Moura, L.: A fast linear-arithmetic solver for DPLL(T). In: Ball, T., Jones, R.B. (eds.) CAV 2006. LNCS, vol. 4144, pp. 81-94. Springer, Heidelberg (2006)
6. Dutertre, B., de Moura, L.: Integrating simplex with DPLL(T). Technical Report SRI-CSL-06-01, SRI International (May 2006)
7. Eén, N., Sörensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502-518. Springer, Heidelberg (2004)
8. Faure, G., Nieuwenhuis, R., Oliveras, A., Rodríguez-Carbonell, E.: SAT modulo the theory of linear arithmetic: Exact, inexact and commercial solvers. In: Kleine Büning, H., Zhao, X. (eds.) SAT 2008. LNCS, vol. 4996, pp. 77-90. Springer, Heidelberg (2008)
9. Free Software Foundation. GNU Linear Programming Kit Reference Manual, version 4.34 (December 2008)
10. Free Software Foundation. GNU MP The GNU Multiple Precision Arithmetic Library, 4.2.4 edition (September 2008)
11. Gärtner, B.: Exact arithmetic at low cost - a case study in linear programming. In: SODA 1998: Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, pp. 157-166. SIAM, Philadelphia (1998)
12. Hales, T.C.: Some algorithms arising in the proof of the Kepler conjecture, arXiv:math/0205209v1
13. Hales, T.C.: A proof of the Kepler conjecture. Ann. Math. 162, 1065-1185 (2005)
14. Koch, T.: The final NETLIB-LP results. Op. Res. Letters 32(2), 138-142 (2004)
15. Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1998)