Hidden verification for computational mathematics

Authors:
Hanne Gottliebsen;Tom Kelsey;Ursula Martin
Affiliations:
National Institue of Aerospace, 144 Research Drive, Hampton, VA 23666, USA;University of St Andrews, School of Computer Science, North Haugh, St Andrews KY16 9SS, UK;Queen Mary, University of London, Mile End Road, London E1 4NS, UK
Venue:
Journal of Symbolic Computation
Year:
2005

Citing 15
Cited 1

AXIOM: the scientific computation system

AXIOM: the scientific computation system
MP: a protocol for efficient exchange of mathematical expressions

ISSAC '94 Proceedings of the international symposium on Symbolic and algebraic computation
Theorems and algorithms: an interface between Isabelle and Maple

ISSAC '95 Proceedings of the 1995 international symposium on Symbolic and algebraic computation
Enhancing the NUPRL proof development system and applying it to computational abstract algebra

Enhancing the NUPRL proof development system and applying it to computational abstract algebra
A survey of the Theorema project

ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
REDLOG: computer algebra meets computer logic

ACM SIGSAM Bulletin
Nonlinear control system design by quantifier elimination

Journal of Symbolic Computation - Special issue: applications of quantifier elimination
Lightweight formal methods for computer algebra systems

ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
Automated theorem proving in support of computer algebra: symbolic definite integration as a case study

ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
Analytica – An Experiment in Combining Theorem Proving and Symbolic Computation

Journal of Automated Reasoning
Equality in computer algebra and beyond

Journal of Symbolic Computation - Integrated reasoning and algebra systems
Reasoning About the Reals: The Marriage of HOL and Maple

LPAR '93 Proceedings of the 4th International Conference on Logic Programming and Automated Reasoning
Integration in PVS: Tables, Types, and Model Checking

TACAS '97 Proceedings of the Third International Workshop on Tools and Algorithms for Construction and Analysis of Systems
Elements of Mathematical Analysis in PVS

TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
Floating Point Verification in HOL

Proceedings of the 8th International Workshop on Higher Order Logic Theorem Proving and Its Applications

A web application for mathematics education

ICWL'07 Proceedings of the 6th international conference on Advances in web based learning

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.