Hidden verification for computational mathematics

• Autores: Tom Kelsey, Ursula Martin, Hanne Gottliebsen
• Localización: Journal of symbolic computation, ISSN 0747-7171, Vol. 39, Nº 5, 2005, págs. 539-567
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • We present hidden verification as a means to make the power of computational logic available to users of computer algebra systems while shielding them from its complexity. We have implemented in PVS a library of facts about elementary and transcendental functions, and automatic procedures to attempt proofs of continuity, convergence and differentiability for functions in this class. These are called directly from Maple by a simple pipe-lined interface. Hence we are able to support the analysis of differential equations in Maple by direct calls to PVS for: result refinement and verification, discharge of verification conditions, harnesses to ensure more reliable differential equation solvers, and verifiable look-up tables.