Advertisement

Formal Verification of Nonlinear Inequalities with Taylor Interval Approximations

  • Alexey Solovyev
  • Thomas C. Hales
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7871)

Abstract

We present a formal tool for verification of multivariate nonlinear inequalities. Our verification method is based on interval arithmetic with Taylor approximations. Our tool is implemented in the HOL Light proof assistant and it is capable to verify multivariate nonlinear polynomial and non-polynomial inequalities on rectangular domains. One of the main features of our work is an efficient implementation of the verification procedure which can prove non-trivial high-dimensional inequalities in several seconds. We developed the verification tool as a part of the Flyspeck project (a formal proof of the Kepler conjecture). The Flyspeck project includes about 1000 nonlinear inequalities. We successfully tested our method on more than 100 Flyspeck inequalities and estimated that the formal verification procedure is about 3000 times slower than an informal verification method implemented in C++. We also describe future work and prospective optimizations for our method.

Keywords

Interval Arithmetic Original Domain Taylor Approximation Polynomial Inequality Nonlinear Inequality 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Harrison, J.: The HOL Light theorem prover (2010), http://www.cl.cam.ac.uk/~jrh13/hol-light/index.html
  2. 2.
    Solovyev, A.: A tool for formal verification of nonlinear inequalities (2012), http://flyspeck.googlecode.com/files/FormalVerifier.pdf
  3. 3.
    Solovyev, A.: Formal Computations and Methods. PhD thesis, University of Pittsburgh (2012), http://d-scholarship.pitt.edu/16721/
  4. 4.
    Hales, T.C.: Introduction to the Flyspeck project. In: Coquand, T., Lombardi, H., Roy, M.F. (eds.) Mathematics, Algorithms, Proofs. Dagstuhl Seminar Proceedings, vol. 05021, Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany (2006), http://drops.dagstuhl.de/opus/volltexte/2006/432 Google Scholar
  5. 5.
    Hales, T.C.: The Flyspeck Project (2012), http://code.google.com/p/flyspeck
  6. 6.
    Hales, T.C., Ferguson, S.P.: The Kepler conjecture. Discrete and Computational Geometry 36(1), 1–269 (2006)MathSciNetCrossRefGoogle Scholar
  7. 7.
    Hales, T.C.: Dense Sphere Packings: a blueprint for formal proofs. London Math. Soc. Lecture Note Series, vol. 400. Cambridge University Press (2012)Google Scholar
  8. 8.
    Hales, T.C.: Some algorithms arising in the proof of the Kepler conjecture. Discrete and Computational Geometry 25, 489–507 (2003)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Tarski, A.: A decision method for elementary algebra and geometry, 2nd edn. University of California Press, Berkeley and Los Angeles (1951)zbMATHGoogle Scholar
  10. 10.
    Collins, G.E.: Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 134–183. Springer, Heidelberg (1975)Google Scholar
  11. 11.
    McLaughlin, S., Harrison, J.: A proof-producing decision procedure for real arithmetic. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 295–314. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  12. 12.
    Harrison, J.: Verifying nonlinear real formulas via sums of squares. In: Schneider, K., Brandt, J. (eds.) TPHOLs 2007. LNCS, vol. 4732, pp. 102–118. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  13. 13.
    Akbarpour, B., Paulson, L.C.: MetiTarski: An automatic prover for the elementary functions. In: Autexier, S., Campbell, J., Rubio, J., Sorge, V., Suzuki, M., Wiedijk, F. (eds.) AISC/Calculemus/MKM 2008. LNCS (LNAI), vol. 5144, pp. 217–231. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  14. 14.
    Paulson, L.C.: MetiTarski: Past and future. In: Beringer, L., Felty, A. (eds.) ITP 2012. LNCS, vol. 7406, pp. 1–10. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  15. 15.
    Chevillard, S., Harrison, J., Jolde, M., Lauter, C.: Efficient and accurate computation of upper bounds of approximation errors. Theor. Comput. Sci. 412(16), 1523–1543 (2011)zbMATHCrossRefGoogle Scholar
  16. 16.
    Zumkeller, R.: Global Optimization in Type Theory. PhD thesis, École Polytechnique Paris (2008)Google Scholar
  17. 17.
    Muñoz, C., Narkawicz, A.: Formalization of a representation of Bernstein polynomials and applications to global optimization. Journal of Automated Reasoning (2012) (accepted for publication)Google Scholar
  18. 18.
    Zumkeller, R.: Formal global optimisation with Taylor models. In: Furbach, U., Shankar, N. (eds.) IJCAR 2006. LNCS (LNAI), vol. 4130, pp. 408–422. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  19. 19.
    Zumkeller, R.: Sergei. A Global Optimization Tool (2009), http://code.google.com/p/sergei/
  20. 20.
    Daumas, M., Lester, D., Muñoz, C.: Verified real number calculations: A library for interval arithmetic. IEEE Transactions on Computers 58(2), 226–237 (2009)CrossRefGoogle Scholar
  21. 21.
    Harrison, J.V.: A HOL theory of Euclidean space. In: Hurd, J., Melham, T. (eds.) TPHOLs 2005. LNCS, vol. 3603, pp. 114–129. Springer, Heidelberg (2005)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Alexey Solovyev
    • 1
  • Thomas C. Hales
    • 1
  1. 1.Department of MathematicsUniversity of PittsburghPittsburghUSA

Personalised recommendations