Formal Aspects of Computing

, Volume 25, Issue 6, pp 993–1016

Applications of real number theorem proving in PVS

  • Hanne Gottliebsen
  • Ruth Hardy
  • Olga Lightfoot
  • Ursula Martin
Open AccessOriginal Article

DOI: 10.1007/s00165-012-0232-9

Cite this article as:
Gottliebsen, H., Hardy, R., Lightfoot, O. et al. Form Asp Comp (2013) 25: 993. doi:10.1007/s00165-012-0232-9

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 provingPVSMapleControl systemsTest suiteAir traffic controlHigher order theorem proving
Download to read the full article text

Copyright information

© The Author(s) 2012

Authors and Affiliations

  • Hanne Gottliebsen
    • 1
  • Ruth Hardy
    • 2
  • Olga Lightfoot
    • 1
  • Ursula Martin
    • 1
  1. 1.School of Electronic Engineering and Computer ScienceQueenMary, University of LondonLondonUK
  2. 2.School of Computer ScienceUniversity of St AndrewsSt AndrewsUK