Synthesizing Switching Logic Using Constraint Solving

  • Authors:
  • Ankur Taly;Sumit Gulwani;Ashish Tiwari

  • Affiliations:
  • Computer Science Dept., Stanford University,;Microsoft Research, Redmond, WA 98052;SRI International, Menlo Park, CA 94025

  • Venue:
  • VMCAI '09 Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation
  • Year:
  • 2008

Quantified Score

Hi-index 0.02

Visualization

Abstract

A new approach based on constraint solving techniques wasrecently proposed for verification of hybrid systems. This approachworks by searching for inductive invariants of a given form. Inthis paper, we extend that work to automatic synthesis of safehybrid systems. Starting with a multi-modal dynamical system and asafety property, we present a sound technique for synthesizing aswitching logic for changing modes so as to preserve the safetyproperty. By construction, the synthesized hybrid system iswell-formed and is guaranteed safe. Our approach is based onsynthesizing a controlled invariant that is sufficient to provesafety. The generation of the controlled invariant is cast as aconstraint solving problem. When the system, the safety property,and the controlled invariant are all expressed only usingpolynomials, the generated constraint is an ∃ ∀formula in the theory of reals, which we solve using SMT solvers.The generated controlled invariant is then used to arrive at themaximally liberal switching logic.