NASA Formal Methods Symposium

NFM 2014: NASA Formal Methods pp 188-202

Verifying Hybrid Systems Involving Transcendental Functions

  • Paul Jackson
  • Andrew Sogokon
  • James Bridge
  • Lawrence Paulson
Conference paper

DOI: 10.1007/978-3-319-06200-6_14

Volume 8430 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Jackson P., Sogokon A., Bridge J., Paulson L. (2014) Verifying Hybrid Systems Involving Transcendental Functions. In: Badger J.M., Rozier K.Y. (eds) NASA Formal Methods. NFM 2014. Lecture Notes in Computer Science, vol 8430. Springer, Cham

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Paul Jackson
    • 1
  • Andrew Sogokon
    • 1
  • James Bridge
    • 2
  • Lawrence Paulson
    • 2
  1. 1.School of InformaticsUniversity of EdinburghUK
  2. 2.Computer LaboratoryUniversity of CambridgeUK