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.
Original language | English |
---|---|
Pages (from-to) | 993-1016 |
Number of pages | 24 |
Journal | Formal Aspects of Computing |
Volume | 25 |
Issue number | 6 |
Early online date | 8 Jun 2012 |
DOIs | |
Publication status | Published - Nov 2013 |