Applications of real number theorem proving in PVS

This work is supported by funding from the EPSRC under grants EP/H500162, EP/F02309X and GR/S31242Real number theorem proving has many uses, particularly for verification of safety critical systems and systems for which design errors may be costly. We discuss a chain of developments building on real number theorem proving in PVS. This leads from the verification of aspects of an air traffic control system, through work on the integration of computer algebra and automated theorem proving to a new tool, NRV, first presented here that builds on the capabilities of Maple and PVS to provide a verified and automatic analysis of Nichols plots. This automates a standard technique used by control engineers and greatly improves assurance compared with the traditional method of visual inspection of the Nichols plots.Publisher PDFPeer reviewe

Guided growth: current perspectives and future challenges

Guided growth by tethering part of the growth plate is an established technique for the correction of frontal angular deformities about the knee in children. A better understanding of the underlying conditions, factors affecting longitudinal growth, and mechanism of response of the growth plate to retardation forces could lead to improvement and expansion of this technique to other sites and indications. This review article highlights areas of future research and outlines the possible future of guided growth techniques. </ul

Computer algebra meets automated theorem proving: Integrating Maple and pvs

Abstract. 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.