Inductive Verification of Hybrid Automata with Strongest Postcondition Calculus

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.
Complete list of metadatas

Cited literature [22 references]  Display  Hide  Download

https://hal.inria.fr/hal-00806701
Contributor : Guillaume Melquiond <>
Submitted on : Tuesday, April 2, 2013 - 11:08:51 AM
Last modification on : Friday, October 4, 2019 - 1:47:30 AM
Long-term archiving on : Wednesday, July 3, 2013 - 4:04:51 AM

File

article.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Daisuke Ishii, Guillaume Melquiond, Shin Nakajima. Inductive Verification of Hybrid Automata with Strongest Postcondition Calculus. iFM - 10th International Conference on Integrated Formal Methods - 2013, Jun 2013, Turku, Finland. pp.139-153, ⟨10.1007/978-3-642-38613-8_10⟩. ⟨hal-00806701⟩

Share

Metrics

Record views

733

Files downloads

304