Formal Proofs of Rounding Error Bounds With application to an automatic positive definiteness check
暂无分享,去创建一个
[1] Florent de Dinechin,et al. Assisted verification of elementary functions using Gappa , 2006, SAC.
[2] Siegfried M. Rump,et al. Verification methods: rigorous results using floating-point arithmetic , 2010, Acta Numerica.
[3] James Demmel,et al. IEEE Standard for Floating-Point Arithmetic , 2008 .
[4] Enrico Tassi,et al. A Small Scale Reflection Extension for the Coq system , 2008 .
[5] Yves Bertot,et al. Interactive Theorem Proving and Program Development: Coq'Art The Calculus of Inductive Constructions , 2010 .
[6] John Harrison. Floating Point Verification in HOL , 1995, TPHOLs.
[7] Cyril Cohen,et al. Construction of Real Algebraic Numbers in Coq , 2012, ITP.
[8] Guillaume Melquiond,et al. Formal Proof of a Wave Equation Resolution Scheme: The Method Error , 2010, ITP.
[9] Siegfried M. Rump,et al. Verification of Positive Definiteness , 2006 .
[10] Mei Han An,et al. accuracy and stability of numerical algorithms , 1991 .
[11] Guillaume Melquiond,et al. Flocq: A Unified Library for Proving Floating-Point Algorithms in Coq , 2011, 2011 IEEE 20th Symposium on Computer Arithmetic.
[12] Claude-Pierre Jeannerod,et al. Improved Backward Error Bounds for LU and Cholesky Factorizations , 2014, SIAM J. Matrix Anal. Appl..
[13] Ioana Pasca,et al. Canonical Big Operators , 2008, TPHOLs.
[14] Pierre Roux,et al. Computing Quadratic Invariants with Min- and Max-Policy Iterations: A Practical Comparison , 2014, FM.