Help Privacy Policy Disclaimer
  Advanced SearchBrowse




Conference Paper

Verification and Synthesis Using Real Quantifier Elimination


Sturm,  Thomas       
Automation of Logic, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available

Sturm, T., & Tiwari, A. (2011). Verification and Synthesis Using Real Quantifier Elimination. In A. Leykin (Ed.), ISSAC 2011 (pp. 329-336). New York, NY: ACM. doi:10.1145/1993886.1993935.

Cite as: https://hdl.handle.net/11858/00-001M-0000-0010-14F9-7
We present the application of real quantifier elimination to formal verification and synthesis of continuous and switched dynamical systems. Through a series of case studies, we show how first-order formulas over the reals arise when formally analyzing models of complex control systems. Existing off-the-shelf quantifier elimination procedures are not successful in eliminating quantifiers from many of our benchmarks. We therefore automatically combine three established software components: virtual subtitution based quantifier elimination in Reduce/Redlog, cylindrical algebraic decomposition implemented in Qepcad, and the simplifier Slfq implemented on top of Qepcad. We use this combination to successfully analyze various models of systems including adaptive cruise control in automobiles, adaptive flight control system, and the classical inverted pendulum problem studied in control theory.