Abstract
In this paper, we present a formal proof, developed in the Coq system, of the correctness of an automatic differentiation algorithm. This is an example of interaction between formal methods and numerical analysis (involving, in particular, real numbers). We study the automatic differentiation tool, called O∂yssée, which deals with FORTRAN programs, and using Coq we formalize the correctness proof of the algorithm used by O∂yssée for a subset of programs. To do so, we briefly describe the library of real numbers in Coq including real analysis, which was originally developed for this purpose, and we formalize a semantics for a subset of FORTRAN programs. We also discuss the relevance of such a proof.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
The ADIC Home Page, http://www-fp.mcs.anl.gov/adic/.
The PADRE2 Home Page. http://warbler.ise.chuo-u.ac.jp/Padre2/.
C. Bischof, A. Carle, P. Khademi, A. Mauer, and P. Hovland. ADIFOR2.0 user’s guide. Technical Report ANL/MCS-TM-192, CRPC-TR95516-S, Argonne National Laboratory Technical Memorandum, June 1998.
Pietro Di Giannantonio and Alberto Ciaffaglione. A co-inductive approach to real numbers. In Proc. of TYPES’99, volume 1956, pages 114–130. Springer-Verlag LNCS, 1999.
Christèle Faure and Yves Papegay. Odyssée user’s guide version 1.7. Technical Report 0224, INRIA Sophia-Antipolis, September 1998.
Jean-Christophe Filliâtre. Preuves de programmes impératifs en théories des types. PhD thesis, Université Paris-Sud, Juillet 1999.
Herman Geuvers, Freek Wiedijk, and Jan Zwanenburg. Equational Reasoning via Partial Reflection. In Proceedings of TPHOL. Springer-Verlag, August 2000.
M.J.C. Gordon and T.F. Melham. Introduction to HOL: A Theorem Proving Environment for Higher Order Logic. Cambridge University Press, 1993.
Carl A. Gunter. Semantics of Programming Languages: Structures and Techniques. Foundations of Computing. MIT Press, 1992.
John Harrison. Theorem Proving with the Real Numbers. Springer-Verlag, 1998.
Micaela Mayero. Formalisation et automatisation de preuves en analyses éelle et numérique. PhD thesis, Université Paris 6, Décembre 2001. http://logical.inria.fr/~mayero/ .
Sam Owre, Natarajan Shankar, and John Rushby. PVS: A prototype verification System. In Proceedings of CADE 11, Saratoga Springs, New York, June 1992.
LogiCal Project The Coq Development Team. The Coq Proof Assistant Reference Manual Version 7.2. INRIA-Rocquencourt, December 2001. http://coq.inria.fr/doc-eng.html .
R. Towle. Control and data dependence for program transformations. PhD thesis, Univ. of Illinois, Urbana, March 1976.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mayero, M. (2002). Using Theorem Proving for Numerical Analysis Correctness Proof of an Automatic Differentiation Algorithm. In: Carreño, V.A., Muñoz, C.A., Tahar, S. (eds) Theorem Proving in Higher Order Logics. TPHOLs 2002. Lecture Notes in Computer Science, vol 2410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45685-6_17
Download citation
DOI: https://doi.org/10.1007/3-540-45685-6_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44039-0
Online ISBN: 978-3-540-45685-8
eBook Packages: Springer Book Archive