Proof certificates and non-linear arithmetic constraints

Proceedings of the 2011 IEEE Symposium on Design and Diagnostics of Electronic Circuits and Systems, DDECS 2011

Volumn , Issue , 2011, Pages 429-434

  Kupferschmid, S ^a   Becker, B ^a   Teige, T ^b   Franzle M ^b  

^a UNIVERSITY OF FREIBURG   (Germany)

^b UNIVERSITY OF OLDENBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARITHMETIC CONSTRAINTS; CERTIFICATION METHODS; COMPUTER-AIDED VERIFICATIONS; CONSTRAINT SOLVERS; DISCRETE/CONTINUOUS; NON-LINEAR; SAFETY CRITICAL SYSTEMS; SATISFIABILITY; SYMBOLIC METHODS;

COMPUTER AIDED ANALYSIS; FORMAL LOGIC;

RELIABILITY ANALYSIS;

EID: 79959932010     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DDECS.2011.5783131     Document Type: Conference Paper

References (20)

1. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu, "Symbolic model checking without BDDs," in Proc. of TACAS 1999, 1999.
2. J. F. Groote, J. W. C. Koorn, and S. F. M. van Vlijmen, "The Safety Guaranteeing System at Station Hoorn-Kersenboogerd," in Conference on Computer Assurance, 1995.
3. R. Nieuwenhuis, A. Oliveras, and C. Tinelli, "Solving SAT and SAT Modulo Theories: from an Abstract Davis-Putnam-Logemann-Loveland Procedure to DPLL(T)," Journal of the ACM, 2006.
4. S. Ranise and C. Tinelli, "Satisfiability modulo theories," IEEE Intelli-gent Systems, 2006.
5. M. Fränzle, C. Herde, T. Teige, S. Ratschan, and T. Schubert, "Efficient Solving of Large Non-linear Arithmetic Constraint Systems with Complex Boolean Structure," JSAT, 2007.
6. W. Craig, "Linear reasoning: A new form of the Herbrand-Gentzen theorem," Journal of Symbolic Logic, vol. 22, no. 3, pp. 250-268, 1957.
7. K. L. McMillan, "Interpolation and SAT-based model checking." in CAV, 2003, pp. 1-13.
8. L. Zhang, C. Madigan, M. Moskewicz, and S. Malik, "Efficient Conflict Driven Learning in a Boolean Satisfiability Solver," in IEEE/ACM International Conference on Computer-Aided Design, 2001.
9. A. Tarski, A Decision Method for Elementary Algebra and Geometry. Berkeley: Univ. of California Press, 1951.
10. M. Davis, G. Logemann, and D. Loveland, "A Machine Program for Theorem Proving," CACM, 1962.
11. M. Davis and H. Putnam, "A Computing Procedure for Quantification Theory," Journal of the ACM, 1960.
12. F. Benhamou and L. Granvilliers, "Continuous and interval constraints," in Handbook of Constraint Programming, ser. Foundations of Artificial Intelligence, F. Rossi, P. van Beek, and T. Walsh, Eds., 2006.
13. G. S. Tseitin, "On the complexity of derivation in propositional calculus," Studies in Constructive Mathematics and Mathematical Logic, Part 2, pp. 115-125, 1970.
14. F. Benhamou, "Heterogeneous Constraint Solving," in Proc. of the Fifth International Conf. on Algebraic and Logic Programming, 1996.
15. F. Benhamou, D. McAllester, and P. V. Hentenryck, "CLP(Intervals) revisited," in Int. Symp. on Logic Progr., 1994.
16. T. J. Hickey, Q. Ju, and M. H. van Emden, "Interval arithmetic: from principles to implementation," Journal of the ACM, 2001.
17. A. Neumaier, Interval Methods for Systems of Equations. Cambridge Univ. Press, 1990.
18. T. Teige, C. Herde, M. Fränzle, and E. Ábrahám, "Conflict Analysis and Restarts in a mixed Boolean and Non-linear Arithmetic Constraint Solver," Reports of SFB/TR 14 AVACS, 2008.
19. F. D. Torrisi and A. Bemporad, "Discrete-time hybrid modeling and verification," in Proc. 41th IEEE Conf. on Decision and Control, 2001.
20. L. Fousse, G. Hanrot, V. Lefèvre, P. Pélissier, and P. Zimmermann, "Mpfr: A multiple-precision binary floating-point library with correct rounding," ACM Trans. Math. Softw., vol. 33, June 2007. [Online]. Available: http://doi.acm.org/10.1145/1236463.1236468