DMCA
Inductive Verification of Hybrid Automata with Strongest Postcondition Calculus
BibTeX
@MISC{Ishii_inductiveverification,
author = {Daisuke Ishii and Guillaume Melquiond and Shin Nakajima},
title = {Inductive Verification of Hybrid Automata with Strongest Postcondition Calculus},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. Safety verification of hybrid systems is a key technique in developing embedded systems that have a strong coupling with the physical environment. We propose an automated logical analytic method for verifying a class of hybrid automata. The problems are more general than those solved by the existing model checkers: our method can verify models with symbolic parameters and nonlinear equations as well. First, we encode the execution trace of a hybrid automaton as an imperative program. Its safety property is then translated into proof obligations by strongest postcondition calculus. Finally, these logic formulas are discharged by state-of-the-art arithmetic solvers (e.g., Mathematica). Our proposed algorithm efficiently performs inductive reasoning by unrolling the execution for some steps and generating loop invariants from verification failures. Our experimental results along with examples taken from the literature show that the proposed approach is feasible. 1
Keyphrases
hybrid automaton strongest postcondition calculus inductive verification imperative program strong coupling logic formula key technique proof obligation inductive reasoning hybrid system model checker physical environment state-of-the-art arithmetic solver verification failure postcondition calculus literature show symbolic parameter loop invariant experimental result safety property automated logical analytic method safety verification execution trace nonlinear equation embedded system
