Applications of real number theorem proving in PVS
MetadataShow full item record
Real 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.
Gottliebsen , H , Hardy , R , Lightfoot , O & Martin , U 2013 , ' Applications of real number theorem proving in PVS ' Formal Aspects of Computing , vol 25 , no. 6 , pp. 993-1016 . DOI: 10.1007/s00165-012-0232-9
Formal Aspects of Computing
The Author(s) © 2012. This article is published with open access at Springerlink.com
This work is supported by funding from the EPSRC under grants EP/H500162, EP/F02309X and GR/S31242
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.