A proof-producing decision procedure for real arithmetic

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

Volumn 3632 LNAI, Issue , 2005, Pages 295-314

  McLaughlin, Scan ^a   Harrison, John ^b  

^a Carnegie Mellon University   (United States)

^b INTEL CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DIGITAL ARITHMETIC; THEOREM PROVING;

QUANTIFIER ELIMINATION; REAL ARITHMETIC; REAL CLOSED FIELDS;

DECISION THEORY;

EID: 26944493043     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11532231_22     Document Type: Conference Paper

References (34)

1. C. Barrett and S. Berezin. CVC Lite: A new implementation of the cooperating validity checker. In R. Alur and D. A. Peled, editors, Computer Aided Verification, 16th International Conference, CAV 2004, volume 3114 of Lecture Notes in Computer Science, pages 515-518, Boston, MA, 2004. Springer-Verlag.
2. M. Blum. Program result checking: A new approach to making programs more reliable. In A. Lingas, R. Karlsson, and S. Carlsson, editors, Automata, Languages and Programming, 20th International Colloquium, ICALP93, Proceedings, volume 700 of Lecture Notes in Computer Science, pages 1-14, Lund, Sweden, 1993. Springer-Verlag.
3. J. Bochnak, M. Coste, and M.-F. Roy. Real Algebraic Geometry, volume 36 of Ergebnisse der Mathematik und ihrer Grenzgebiete. Springer-Verlag, 1998.
4. R. J. Boulton. Efficiency in a fully-expansive theorem prover Technical Report 337, University of Cambridge Computer Laboratory, New Museums Site, Pembroke Street, Cambridge, CB2 3QG, UK, 1993. Author's PhD thesis.
5. B. F. Caviness and J. R. Johnson, editors. Quantifier Elimination and Cylindrical Algebraic Decomposition, Texts and monographs in symbolic computation. Springer-Verlag, 1998.
6. P. J. Cohen. Decision procedures for real and p-adic fields. Communications in Pure and Applied Mathematics, 22:131-151, 1969.
7. G. E. Collins. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. In H. Brakhage, editor, Second Gl Conference on Automata Theory and Formal Languages, volume 33 of Lecture Notes in Computer Science, pages 134-183, Kaiserslautern, 1976. Springer-Verlag.
8. M. Davis. A computer program for Presburger's algorithm. In Summaries of talks presented at the Summer Institute for Symbolic Logic, Cornell University, pages 215-233. Institute for Defense Analyses, Princeton, NJ, 1957. Reprinted in [28], pp. 41-48.
9. E. Engeler. Foundations of Mathematics: Questions of Analysis, Geometry and Algorithmes. Springer-Verlag, 1993.
10. Original German edition Metamathematik der Elementarmathematik in the Series Hochschultext.
11. L. Cårding. Some Points of Analysis and Their History, volume 11 of University Lecture Series. American Mathematical Society / Higher Education Press, 1997.
12. M. J. C. Gordon and T. F. Melham. Introduction to HOL: a theorem proving environment for higher order logic. Cambridge University Press, 1993.
13. M. J. C. Gordon, R. Milner, and C. P. Wadsworth. Edinburgh LCF: A Mechanised Logic of Computation, volume 78 of Lecture Notes in Computer Science. Springer-Verlag, 1979.
14. J. Harrison. Metatheory and reflection in theorem proving: A survey and critique. Technical Report CRC-053, SRI Cambridge, Millers Yard, Cambridge, UK, 1995. Available on the Web as http://www.c1.cam.ac.uk/users/jrh/papers/reflect. dvi.gz.
15. J. Harrison. HOL Light: A tutorial introduction. In M. Srivas and A. Camilleri, editors, Proceedings of the First International Conference on Formal Methods in Computer-Aided Design (FMCAD'96), volume 1166 of Lecture Notes in Computer Science, pages 265-269. Springer-Verlag, 1996.
16. J. Harrison. Theorem Proving with the Real Numbers. Springer-Verlag, 1998. Revised version of author's PhD thesis.
17. J. Harrison. Complex quantifier elimination in HOL. In R. J. Boulton and P. B. Jackson, editors, TPHOLs 2001: Supplemental Proceedings, pages 159-174. Division of Informatics, University of Edinburgh, 2001. Published as Informatics Report Series ED1-INF-RR-0046. Available on the Web at http://www.informatics. ed.ac.uk/publications/report/0046.html.
18. L. Hörmander. The Analysis of Linear Partial Differential Operators II, volume 257 of Grundlehren der mathematischen Wissenschaften. Springer-Verlag, 1983.
19. W. A. Hunt, R. B. Krug, and J. Moore. Linear and nonlinear arithmetic in ACL2. In D. Geist, editor, Proceedings of the 12th Advanced Research Working Conference on Correct Hardware Design and Verification Methods, CHARME 2003, volume 2860 of Lecture Notes in Computer Science, pages 319-333. Springer-Verlag.
20. G. Kreisel and J.-L. Krivine. Elements of mathematical logic: model theory. Studies in Logic and the Foundations of Mathematics. North-Holland, revised second edition, 1971. First edition 1967.
21. Translation of the French 'Elements de logique mathématique, théorie des modeles' published by Dunod, Paris in 1964.
22. R. Kumar, T. Kropf, and K. Schneider. Integrating a first-order automatic prover in the HOL environment. In M. Archer, J. J. Joyce, K. N. Levitt, and P. J. Windley, editors, Proceedings of the 1991 International Workshop on the HOL theorem proving system and its Applications, pages 170-176, University of California at Davis, Davis CA, USA, 1991. IEEE Computer Society Press.
23. A. Mahboubi and L. Pottier. Elimination des quantificateurs sur les rèels en Coq. In Journées Francophones des Langages Applicatifs (JFLA), available on the Web from http://pauillac.inria.fr/jfla/2002/actes/ index.html08-mahboubi. ps, 2002.
24. C. Michaux and A. Ozturk. Quantifier elimination following Muchnik. Université de Mons-Hainaut, Institute de Mathématique, Preprint 10, http://w3.umh.ac.be/math/preprints/src/ozturk020411.pdf, 2002.
25. G. C. Necula. Proof-carrying code. In Conference record of POPL'97: the 24th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 106-119. ACM Press, 1997.
26. P. Parrilo. Semidefinite programming relaxations for semialgebraic problems. Available from the Web at citeseer.nj.nee.com/parrilo01semidefinite. html, 2001.
27. L. C. Paulson. Isabelle: a generic theorem prover, volume 828 of Lecture Notes in Computer Science. Springer-Verlag, 1994. With contributions by Tobias Nipkow.
28. H. Schoutens. Muchnik's proof of Tarski-Seidenberg. Notes available from http://www.math.ohio-state.edu/~schoutens/PDF/Muchnik.pdf, 2001.
29. A. Seidenberg. A new decision method for elementary algebra. Annals of Mathematics, 60:365-374, 1954.
30. J. Siekmann and G. Wrightson, editors. Automation of Reasoning - Classical Papers on Computational Logic, Vol. I (1957-1966). Springer-Verlag, 1983.
31. C. Sturm. Mémoire sue la résolution des équations numériques. Mémoire des Savants Etrangers, 6:271-318, 1835.
32. A. Tarski. A Decision Method for Elementary Algebra and Geometry. University of California Press, 1951. Previous version published as a technical report by the RAND Corporation, 1948; prepared for publication by J. C. C. McKinsey. Reprinted in [5], pp. 24-84.
33. N. N. Vorobjov. Deciding consistency of systems of polynomial in exponent inequalities in subexponential time. In T. Mora and C. Traverso, editors, Proceedings of the MEGA-90 Symposium on Effective Methods in Algebraic Geometry, volume 94 of Progress in Mathematics, pages 491-500, Castiglioncello, Livorno, Italy, 1990. Birkhäuser.
34. V. Weispfenning. Quantifier elimination for real algebra - the quadratic case and beyond. Applicable Algebra in Engineering Communications and Computing, 8:85-101, 1997.