Applications of real number theorem proving in PVS |
| |
Authors: | Hanne Gottliebsen Ruth Hardy Olga Lightfoot Ursula Martin |
| |
Affiliation: | 1. School of Electronic Engineering and Computer Science, QueenMary, University of London, London, UK 2. School of Computer Science, University of St Andrews, St Andrews, UK
|
| |
Abstract: | 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. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|