Original Article

Formal Aspects of Computing

, Volume 25, Issue 6, pp 993-1016

First online:

Open Access This content is freely available online to anyone, anywhere at any time.

Applications of real number theorem proving in PVS

  • Hanne GottliebsenAffiliated withSchool of Electronic Engineering and Computer Science, QueenMary, University of London
  • , Ruth HardyAffiliated withSchool of Computer Science, University of St Andrews
  • , Olga LightfootAffiliated withSchool of Electronic Engineering and Computer Science, QueenMary, University of London
  • , Ursula MartinAffiliated withSchool of Electronic Engineering and Computer Science, QueenMary, University of London Email author 

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

Real number theorem proving PVS Maple Control systems Test suite Air traffic control Higher order theorem proving