A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Computer Algebra Meets Automated Theorem Proving: Integrating Maple and PVS
[chapter]
2001
Lecture Notes in Computer Science
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.
doi:10.1007/3-540-44755-5_4
fatcat:cfup3xln4vduzd5y5zs2ziouye