Info: Zenodo’s user support line is staffed on regular business days between Dec 23 and Jan 5. Response times may be slightly longer than normal.

OpenDepot
Published January 1, 2001 | Version v1
Book chapter Open

Computer Algebra meets Automated Theorem Proving: Integrating Maple and PVS

Creators

  • 1. University of Reading
  • 2. NAG Ltd
  • 3. University of St Andrews
  • 4. SRI International

Contributors

Description

We describe an interface between version 6 of the Maple computer algebra system with the PVS automated theorem prover. The interface is designed to allow Maple users access to the robust and checkable proof environment of PVS.We also extend this environment by the provision of a library of proof strategies for use in real analysis.We demonstrate examples using the interface and the real analysis library. These examples provide proofs which are both illustrative and applicable to genuine symbolic computation problems. This record was migrated from the OpenDepot repository service in June, 2017 before shutting down.

Files

TPHOLs01.pdf

Files (146.2 kB)

Name Size Download all
md5:395844b64f4bb8d027cf59e88d717bef
146.2 kB Preview Download

Additional details

References

  • 1. ABBOTT, J., VAN LEEUWEN, A., AND STROTMAN, A. Objectives of OpenMath. Available from http://www.rrz.uni-koeln.de/themen/Computeralgebra- /OpenMath/, Jan. 1995. 2. ADAMS, A., GOTTLIEBSEN, H., LINTON, S., AND MARTIN, U. Automated theorem proving in support of computer algebra: symbolic definite integration as a case study. In Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation, Vancouver, Canada (1999), ACM Press. 3. BALLARIN, C., HOMANN, K., AND CALMET, J. Theorems and algorithms: An interface between Isabelle and Maple. In Proceedings of the International Symposium on Symbolic and Algebraic Computation (1995), A. Levelt, Ed., ACM Press, pp. 150â��157. 4. BAUER, A., CLARKE, E., AND ZHAO, X. Analytica - an experiment in combining theorem proving and symbolic computation. Journal of Automated Reasoning 21 (1998), 295â��325. 5. BERTOLI, P., CALMET, J., GUINCHIGLIA, F., AND HOMANN, K. Specification and integration of theorem provers and computer algebra systems. In Artificial intelligence and symbolic computation (Plattsburgh, NY, 1998), no. 1476 in Lecture Notes in Computer Science. Springer-Verlag, 1998. 6. BUCHBERGER, B. Symbolic computation: Computer algebra and logic. In Frontiers of Combining Systems (1996), F. Baader and K. Schultz, Eds., Applied Logic Series, Kluwer Academic Publishers, pp. 193â��220. 7. BUCHBERGER, B., JEBELEAN, T., KRIFTNER, F., MARIN, M., TOMUTA, E., AND VASARU, D. A survey of the theorema project. In Proceedings of the 1997 International Symposium on Symbolic and Algebraic Computation (1997), W. Kuechlin, Ed., ACM Press, pp. 384â��391. 8. CALMET, J., AND HOMANN, K. Classification of communication and cooperation mechanisms for logical and symbolic computation systems. In Frontiers of Combining Systems: Proceedings of the 1st International Workshop, Munich (Germany) (1996), F. Baader and K. U. Schulz, Eds., Applied Logic, Kluwer, pp. 221â��234. 9. CHAR, B.W. Maple V language Reference Manual. Springer-Verlag, 1991. 10. DENNIS, L. A., COLLINS, G., NORRISH, M., BOULTON, R., SLIND, K., ROBINSON, G., GORDON, M., AND MELHAM, T. The PROSPER Toolkit. In Proceedings of the 6th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (2000), vol. 1785 of Lecture Notes in Computer Science, Springer-Verlag. 11. DEWAR, M. Special Issue on OPENMATH. ACM SIGSAM Bulletin 34, 2 (June 2000). 12. DOLZMANN, A., AND STURM, T. REDLOG: Computer algebra meets computer logic. ACM SIGSAM Bulletin 31, 2 (June 1997), 2â��9. 13. DUTERTRE, B. Elements of mathematical analysis in PVS. In Theorem Proving in Higher Order Logics: 9th International Conference, TPHOLs â��96 (Turku, Finland, Aug. 1996), 16 J. von Wright, J. Grundy, and J. Harrison, Eds., vol. 1125 of Lecture Notes in Computer Science, Springer-Verlag, pp. 141â��156. 14. GOTTLIEBSEN, H. Transcendental Functions and Continuity Checking in PVS. In Harrison and Aagaard [16], pp. 198â��215. 15. GRAY, S., KAJLER, N., AND WANG, P. S. MP: A Protocol for Efficient Exchange of Mathematical Expressions. In Proc. of the International Symposium on Symbolic and Algebraic Computation (ISSACâ��94), Oxford, GB (July 1994), M. Giesbrecht, Ed., ACM Press, pp. 330â�� 335. 16. HARRISON, J., AND AAGAARD, M., Eds. Theorem Proving in Higher Order Logics: 13th International Conference, TPHOLs 2000 (2000), vol. 1869 of Lecture Notes in Computer Science, Springer-Verlag. 17. HARRISON, J., AND TH�´ERY, L. Reasoning about the reals: the marriage of HOL and Maple. In Logic Programming and Automated Reasoning (1993), A.Voronkov, Ed., no. 698 in Lecture Notes in Artificial Intelligence, LPARâ��93, Springer-Verlag, pp. 351â��359. 18. JACKSON, P. Enhancing the NUPRL Proof Development System and Applying it to Computational Abstract Algebra. PhD thesis, Department of Computer Science, Cornell University, Ithaca, New York, Apr. 1995. 19. JENKS, R. D., AND SUTOR, R. S. AXIOM: the scientific computation system. Numerical Algorithms Group Ltd., 1992. 20. MONAGAN, M., GEDDES, K., HEAL, K., LABAHN, G., VORKOETTER, S., AND MCCARRON, J. Maple6 Programming Guide. Waterloo Maple Inc., 2000. 21. MURPHY, G. M. Ordinary differential equations and their solutions. D. van Nostrand Company, Inc., 1960. 22. OWRE, S., SHANKAR, N., AND RUSHBY, J. M. User Guide for the PVS Specification and Verification System. Computer Science Laboratory, SRI International, Menlo Park, CA, February 1993. 23. OWRE, S., SHANKAR, N., RUSHBY, J. M., AND STRINGER-CALVERT, D. W. J. PVS Language Reference. Computer Science Laboratory, SRI International, Menlo Park, CA, Sept. 1999. 24. OWRE, S., SHANKAR, N., RUSHBY, J. M., AND STRINGER-CALVERT, D. W. J. PVS System Guide. Computer Science Laboratory, SRI International, Menlo Park, CA, Sept. 1999. 25. PAULSON, L. C. The Isabelle Reference Manual. Computer Laboratory, University of Cambridge, February 2001. 26. POLL, E., AND THOMPSON, S. Adding the axioms to AXIOM: Towards a system of automated reasoning in Aldor. Tech. Rep. 6-98, Computing Laboratory, University of Kent at Canterbury, May 1998.