Floating-point verification using theorem proving

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

Volumn 3965 LNCS, Issue , 2006, Pages 211-242

  Harrison, John ^a  

^a INTEL CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SOFTWARE; NUMERICAL METHODS;

FLOATING-POINT ALGORITHMS; HOL LIGHT THEOREM PROVER;

THEOREM PROVING;

EID: 33745934660     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11757283_8     Document Type: Conference Paper

References (60)

1. M. Aagaard and J. Harrison, editors. Theorem Proving in Higher Order Logics: 13th International Conference, TPHOLs 2000, volume 1869 of Lecture Notes in Computer Science. Springer-Verlag, 2000.
2. M. Aigner and G. M. Ziegler. Proofs from The Book. Springer-Verlag, 2nd edition, 2001.
3. K. Appel and W. Haken. Every planar map is four colorable. Bulletin of the American Mathematical Society, 82:711-712, 1976.
4. A. Baker. A Concise Introduction to the Theory of Numbers. Cambridge University Press, 1985.
5. S. Boldo. Preuves formelles en arithmétiques à virgule flottante. PhD thesis, ENS Lyon, 2004. Available on the Web from http://www.ens-lyon.fr/LIP/Pub/Rapports/PhD/PhD2004/PhD2004-05.pdf.
6. W. S. Brown. A simple but realistic model of floating-point computation. ACM Transactions on Mathematical Software, 7:445-480, 1981.
7. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, C-35:677-691, 1986.
8. 20 states and beyond. Information and Computation, 98:142-170, 1992.
9. A. Church. A formulation of the Simple Theory of Types. Journal of Symbolic Logic, 5:56-68, 1940.
10. E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching-time temporal logic. In D. Kozen, editor, Logics of Programs, volume 131 of Lecture Notes in Computer Science, pages 52-71, Yorktown Heights, 1981. Springer-Verlag.
11. C. W. Clenshaw and F. W. J. Olver. Beyond floating point. Journal of the ACM, 31:319-328, 1984.
12. M. Cornea, J. Harrison, and P. T. P. Tang. Scientific Computing for Itanium Based Systems. Intel Press, 2002.
13. M. Cornea-Hasegan. Proving the IEEE correctness of iterative floating-point square root, divide and remainder algorithms. Intel Technology Journal, 1998-Q2:1-11, 1998. Available on the Web as http://developer.intel.com/ technology/itj/q21998/articles/art_3.htm.
14. G. Cousineau and M. Mauny. The Functional Approach to Programming. Cambridge University Press, 1998.
15. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Communications of the ACM, 5:394-397, 1962.
16. T. J. Dekker. A floating-point technique for extending the available precision. Numerical Mathematics, 18:224-242, 1971.
17. C. Dulong. The IA-64 architecture at work. IEEE Computer, 64(7):24-32, July 1998.
18. P. Erdös. Beweis eines Satzes von Tschebyshev. Acta Scientiarum Mathematicarum (Szeged), 5:194-198, 1930.
19. E. Goldberg and Y. Novikov. BerkMin: a fast and robust Sat-solver. In C. D. Kloos and J. D. Franca, editors, Design, Automation and Test in Europe Conference and Exhibition (DATE 2002), pages 142-149, Paris, France, 2002. IEEE Computer Society Press.
20. M. J. C. Gordon. Representing a logic in the LCF metalanguage. In D. Néel, editor, Tools and notions for program construction: an advanced course, pages 163-185. Cambridge University Press, 1982.
21. M. J. C. Gordon and T. F. Melham. Introduction to HOL: a theorem proving environment for higher order logic. Cambridge University Press, 1993.
22. 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.
23. 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.
24. J. Harrison. Proof style. In E. Giménez and C. Paulin-Mohring, editors, Types for Proofs and Programs: International Workshop TYPES'96, volume 1512 of Lecture Notes in Computer Science, pages 154-172, Aussois, France, 1996, Springer-Verlag.
25. J. Harrison, Theorem Proving with the Real Numbers. Springer-Verlag, 1998. Revised version of author's PhD thesis.
26. J. Harrison. A machine-checked theory of floating point arithmetic, In Y. Bertot, G. Dowek, A. Hirschowitz, C. Paulin, and L. Théry, editors, Theorem Proving in Higher Order Logics: 12th International Conference, TPHOLs'99, volume 1690 of Lecture Notes in Computer Science, pages 113-130, Nice, France, 1999. Springer-Verlag.
27. J. Harrison. Formal verification of floating point trigonometric functions. In W. A. Hunt and S. D. Johnson, editors, Formal Methods in Computer-Aided Design: Third International Conference FMCAD 2000, volume 1954 of Lecture Notes in Computer Science, pages 217-233. Springer-Verlag, 2000.
28. J. Harrison. Formal verification of IA-64 division algorithms. In Aagaard and Harrison [1], pages 234-251.
29. J. Harrison. Formal verification of square root algorithms. Formal Methods in System Design., 22:143-153, 2003.
30. J. Harrison. Isolating critical cases for reciprocals using integer factorization. In J.-C. Bajard and M. Schulte, editors, Proceedings, 16th IEEE Symposium on Computer Arithmetic, pages 148-157, Santiago de Compostela, Spain, 2003. IEEE Computer Society. Currently available from symposium Web site at http://www.dec.usc.es/arith16/papers/paper-150.pdf.
31. J. E. Holm. Floating-Point Arithmetic and Program Correctness Proofs. PhD thesis, Cornell University, 1980.
32. IEEE. Standard for binary floating point arithmetic. ANSI/IEEE Standard 754-1985, The Institute of Electrical and Electronic Engineers, Inc., 345 East 47th Street, New York, NY 10017, USA, 1985.
33. C. Jacobi. Formal Verification of a Fully IEEE Compliant Floating Point Unit. PhD thesis, University of the Saarland, 2002. Available on the Web as http://engr.smu.edu/seidel/research/diss-jacobi.ps.gz.
34. R. Kaivola and M. D. Aagaard. Divider circuit verification with model checking and theorem proving. In Aagaard and Harrison [1], pages 338-355.
35. S. Linnainmaa. Analysis of some known methods of improving the accuracy of floating-point sums. BIT, 14:167-202, 1974.
36. D. W. Loveland. Mechanical theorem-proving by model elimination. Journal of the ACM, 15:236-251, 1968.
37. P. Markstein. IA-64 and Elementary Functions: Speed and Precision. Prentice-Hall, 2000.
38. P. W. Markstein. Computation of elementary functions on the IBM RISC System/6000 processor. IBM Journal of Research and Development, 34:111-119, 1990.
39. O. Møller. Quasi double-precision in floating-point addition. BIT, 5:37-50, 1965.
40. K86 floating-point division program. IEEE Transactions on Computers, 47:913-926, 1998.
41. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proceedings of the 38th Design Automation Conference (DAC 2001), pages 530-535. ACM Press, 2001.
42. J.-M. Muller. Elementary functions: Algorithms and Implementation. Birkhäuser, 1997.
43. J.-M. Muller. On the definition of ulp(x). Research Report 2005-09, ENS Lyon, 2005.
44. J. O'Leary, X, Zhao, R. Gerth, and C.-J. H. Seger. Formally verifying IEEE compliance of floating-point hardware. Intel Technology Journal, 1999-Q1:1-14, 1999. Available on the Web as http://developer.intel.com/ technology/itj/q11999/articles/art_5.htm.
45. V. R. Pratt. Anatomy of the Pentium bug. In P. D. Mosses, M. Nielsen, and M. I. Schwartzbach, editors, Proceedings of the 5th International Joint Conference on the theory and practice of software development (TAPSOFT'95), volume 915 of Lecture Notes in Computer Science, pages 97-107, Aarhus, Denmark, 1995. Springer-Verlag.
46. D. M. Priest. On Properties of Floating Point Arithmetics: Numerical Stability and the Cost of Accurate Computations. PhD thesis, University of California, Berkeley, 1992. Available on the Web as ftp://ftp.icsi.berkeley.edu/ pub/theory/priest-thesis.ps.Z.
47. J. P. Queille and J. Sifakis. Specification and verification of concurrent programs in CESAR. In Proceedings of the 5th International Symposium on Programming, volume 137 of Lecture Notes in Computer Science, pages 195-220. Springer-Verlag, 1982.
48. K. Quinn. Ever had problems rounding off figures? The stock exchange has. Wall Street Journal, November 8, 1983.
49. M. E. Remes. Sur le calcul effectif des polynomes d'approximation de Tchebichef. Comptes Rendus Hebdomadaires des Séances de l'Académie des Sciences, 199:337-340, 1934.
50. D. Rusinoff. A mechanically checked proof of IEEE compliance of a register-transfer-level specification of the AMD-K7 floating-point multiplication, division, and square root instructions. LMS Journal of Computation and Mathematics, 1:148-200, 1998. Available on the Web via http://www.onr.com/user/russ/david/k7-div-sqrt.html.
51. J. Sawada. Formal verification of divide and square root algorithms using series calculation. In D. Borrione, M. Kaufmann, and J. Moore, editors, 3rd International Workshop on the ACL2 Theorem Prover and its Applications, pages 31-49. University of Grenoble, 2002.
52. C.-J. H. Seger and R. E. Bryant. Formal verification by symbolic evaluation of partially-ordered trajectories. Formal Methods in System Design, 6:147-189, 1995.
53. G. Stålmarck and M. Säflund. Modeling and verifying systems and software in prepositional logic. In B. K. Daniels, editor, Safety of Computer Control Systems, 1990 (SAFECOMP '90), pages 31-36, Gatwick, UK, 1990. Pergamon Press.
54. P. H. Sterbenz. Floating-Point Computation. Prentice-Hall, 1974.
55. S. Story and P. T. P. Tang. New algorithms for improved transcendental functions on IA-64. In I. Koren and P. Kornerup, editors, Proceedings, 14th IEEE symposium on on computer arithmetic, pages 4-11, Adelaide, Australia, 1999. IEEE Computer Society.
56. th Symposium on Computer Arithemtic, pages 232-236, 1991.
57. P. Weis and X. Leroy. Le langage Caml. InterEditions, 1993. See also the CAML Web page: http://pauillac.inria.fr/caml/.
58. A. v. Wijngaarden. Numerical analysis as an independent science. BIT, 6:68-81, 1966.
59. J. H. Wilkinson. Rounding Errors in Algebraic Processes, volume 32 of National Physical Laboratory Notes on Applied Science. Her Majesty's Stationery Office (HMSO), London, 1963.
60. N. Wirth. Systematic Programming: An Introduction. Prentice-Hall, 1973.