Real number calculations and theorem proving

Lecture Notes in Computer Science

Volumn 3603, Issue , 2005, Pages 195-210

  Muñoz, César ^a   Lester, David ^b  

^a NATIONAL INSTITUTE OF AEROSPACE   (United States)

^b UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTIONS; MATHEMATICAL INSTRUMENTS; NUMBER THEORY;

PROOF ASSISTANTS; REAL NUMBER CALCULATIONS; TRANCENDENTAL FUNCTIONS;

THEOREM PROVING;

EID: 26844465119     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11541868_13     Document Type: Conference Paper

References (27)

1. M. Abramovitz and I. Stegun. Handbook of Mathematical Functions. National Bureau of Standards, 1972.
2. S. Boutin. Using reflection to build efficient and certified decision procedures. Lecture Notes in Computer Science, 1281:515-530, 1997.
3. A. Ciaffaglione. Certified Reasoning on Real Numbers and Objects in Coinductive Type Theory. PhD thesis, Université degli Studi di Udine, 1993.
4. M. Daumas and G. Melquiond. Generating formally certified bounds on values and round-off errors. In Real Numbers and Computers, pages 55-70, Dagstuhl, Germany, 2004.
5. M. Daumas, G. Melquiond, and C. Muñoz. Guaranteed proofs using interval arithmetic. Accepted for publication at the 17th IEEE Symposium on Computer Arithmetic, 1995.
6. B. Dutertre. Elements of mathematical analysis in PVS. In J. von Wright, J. Grundy, , and J. Harrison, editors. Theorem Proving in Higher Order Logics: 9th International Conference. TPHOLs'97, number 1125 in Lecture Notes in Computer Science, pages 141-156, Turku, Finland, August 1996. Springer-Verlag.
7. J. Fleuriot and L. Paulson. Mechanizing nonstandard real analysis. LMS Journal of Computation and Mathematics, 3:140-190, 2000.
8. R. Gamboa. Mechanically Verifying Real-Valued Algorithms in ACL2. PhD thesis, University of Texas at Austin, May 1999.
9. H. Gottliebsen. Automated Theorem Proving for Mathematics: Real Analysis in PVS. PhD thesis, University of St Andrews, June 2001.
10. P. Gowland and D. Lester. A survey of exact computer arithmetic. In Jens Blanck, Vasco Brattka, Peter Hertling, and Klaus Weihrauch, editors, Computability and Complexity in Analysis, volume 272 of Informatik Berichte, pages 99-115. FernUniversität Hagen, September 2000. CCA2000 Workshop, Swansea, Wales, September 17-19, 2000.
11. J. Harrison. Metatheory and reflection in theorem proving: A survey and critique. Technical Report CRC-053, SRI Cambridge, Millers Yard, Cambridge, UK, 1995.
12. J. Harrison. Theorem Proving with the Real Numbers. Springer-Verlag, 1998.
13. T. Hickey, Q. Ju, and M.H. van Emden. Interval arithmetic: from principles to implementation. Journal of the ACM, 2001.
14. R. B. Kearfott. Interval computations: Introduction, uses, and resources. Euromath Bulletin, 2(1):95-112, 1996.
15. M. Mayero. Formalisation et automatisation de preuves en analyses réelle et numérique. PhD thesis, Université Paris VI, décembre 2001.
16. V. Ménissier. Arithmétique Exacte: Conception, Algorithmique et Performances d'une Implantation Informatique en Précision Arbitraire. PhD thesis, Université Paris VI, Paris, France, 1994.
17. C. Muñoz. PVSio reference manual - Version 2.a. Available from http://research.nianet.org/~munoz/PVSio, 2004.
18. C. Muñoz, V. Carreño, G. Dowek, and R.W. Butler. Formal verification of conflict detection algorithms. International Journal on Software Tools for Technology Transfer, 4(3);371-380, 2003.
19. M. Niqui. Formalising Exact Arithmetic: Representations, Algorithms and Proofs. PhD thesis, Radboud University Nijmegen, 1994.
20. S. Owre, J. M. Rushby, and N. Shankar. PVS: A prototype verification system. In Deepak Kapur, editor, 11th International Conference on Automated Deduction (CADE), volume 607 of Lecture Notes in Artificial Intelligence, pages 748-752, Saratoga, NY, June 1992. Springer-Verlag.
21. M. Pour-El and J. Richards. Computability in Analysis and Physics. Perspectives in Mathematical Logic. Springer, Berlin, 1989.
22. R.M. Robinson. Review of "Peter, R., Rekursive Funktionen". The Journal of Symbolic Logic, 16:280-282, 1951.
23. N. Shankar. Efficiently executing PVS. Project report, Computer Science Laboratory, SRI International, Menlo Park, CA, November 1999. Available at http://www.csl.sri.com/shankar/PVSeval.ps.gz.
24. E. Specker. Nicht konstruktiv beweisbare Sätze der Analysis. The Journal of Symbolic Logic, 14(3):145-158, 1949.
25. A. Turing. On computable numbers, with an application to the "Entscheidungsproblem". Proceedings of the London Mathematical Society, 42(2):230-265, 1936.
26. F. W. von Henke, S. Pfab, H. Pfeifer, and H. Rueß. Case Studies in Meta-Level Theorem Proving. In Jim Grundy and Malcolm Newey, editors, Proc. Intl. Conf. on Theorem Proving in Higher Order Logics, number 1479 in Lecture Notes in Computer Science, pages 461-478. Springer-Verlag, September 1998.
27. A. Yakovlev. Classification approach to programming of localizational (interval) computations. Interval Computations, 1(3):61-84, 1992.