Chapter

NASA Formal Methods

Volume 8430 of the series Lecture Notes in Computer Science pp 188-202

Verifying Hybrid Systems Involving Transcendental Functions

  • Paul JacksonAffiliated withLancaster UniversitySchool of Informatics, University of Edinburgh
  • , Andrew SogokonAffiliated withLancaster UniversitySchool of Informatics, University of Edinburgh
  • , James BridgeAffiliated withLancaster UniversityComputer Laboratory, University of Cambridge
  • , Lawrence PaulsonAffiliated withLancaster UniversityComputer Laboratory, University of Cambridge

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We explore uses of a link we have constructed between the KeYmaera hybrid systems theorem prover and the MetiTarski proof engine for problems involving special functions such as sin, cos, exp, etc. Transcendental functions arise in the specification of hybrid systems and often occur in the solutions of the differential equations that govern how the states of hybrid systems evolve over time. To date, formulas exchanged between KeYmaera and external tools have involved polynomials over the reals, but not transcendental functions, chiefly because of the lack of tools capable of proving such goals.