Computer Algebra Meets Automated Theorem Proving: Integrating Maple and PVS
نویسندگان
چکیده
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.
منابع مشابه
Workshop on Verification and Theorem Proving for Continuous Systems (netca Workshop 2005) Workshop on Verification and Theorem Proving for Continuous Systems (netca Workshop 2005)
This paper introduces a method for formal and symbolic analysis of single–input single–output continuous–time control systems. The method is based on traditional control engineering analysis using Nichols plots and thus focuses on the properties of gain (amplitude) and phase–shift. We reduce Nichols plot requirements to a decision problem and present a procedure to decide problems of this type....
متن کاملIntegrating Systems around the User: Combining Isabelle, Maple, and QEPCAD in the Prover's Palette
We describe the Prover’s Palette, a general, modular architecture for combining tools for formal verification, with the key differentiator that the integration emphasises the role of the user. A concrete implementation combining the theorem prover Isabelle with the computer algebra systems Maple and QEPCAD-B is then presented. This illustrates that the design principles of the Prover’s Palette ...
متن کاملSpecification and Integration of Theorem Provers and Computer Algebra Systems
Computer algebra systems (CASs) and automated theorem provers (ATPs) exhibit complementary abilities. CASs focus on efficiently solving domain-specific problems. ATPs are designed to allow for the formalization and solution of wide classes of problems within some logical framework. Integrating CASs and ATPs allows for the solution of problems of a higher complexity than those confronted by each...
متن کاملUser Evaluator Simplifier
Solving sophisticated mathematical problems often requires algebraic algorithms and theorems. However, there are no environments integrating theorem provers and computer algebra systems which consistently provide the inference capabilities of the rst and the powerful arithmetic of the latter systems. As an example for such a mechanized mathematics environment we describe a prototype implementat...
متن کاملProof Planning in
We are building a system that helps us mix proof with computation. On the one hand, theorem proving tools are often good at helping us construct proofs but poor at doing algebraic computations within these proofs. On the other hand, computer algebra systems are good at doing algebraic computations but usually lack the ability to construct proofs. To tackle this problem, we are adding theorem pr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001