Hybrid Systems Verification with Isabelle/HOL: Simpler Syntax, Better Models, Faster Proofs

Simon Foster*, Jonathan Julián Huerta y Munive, Mario Gleirscher, Georg Struth

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

16 Citations (Scopus)
17 Downloads (Pure)

Abstract

We extend a semantic verification framework for hybrid systems with the Isabelle/HOL proof assistant by an algebraic model for hybrid program stores, a shallow expression model for hybrid programs and their correctness specifications, and domain-specific deductive and calculational support. The new store model yields clean separations and dynamic local views of variables, e.g. discrete/continuous, mutable/immutable, program/logical, and enhanced ways of manipulating them using combinators, projections and framing. This leads to more local inference rules, procedures and tactics for reasoning with invariant sets, certifying solutions of hybrid specifications or calculating derivatives with increased proof automation and scalability. The new expression model provides more user-friendly syntax, better control of name spaces and interfaces connecting the framework with real-world modelling languages.

Original languageEnglish
Title of host publicationFormal Methods - 24th International Symposium, FM 2021, Proceedings
EditorsMarieke Huisman, Corina Păsăreanu, Naijun Zhan
PublisherSpringer
Publication date2021
Pages367-386
ISBN (Print)9783030908690
DOIs
Publication statusPublished - 2021
Event24th International Symposium on Formal Methods, FM 2021 - Virtual, Online
Duration: 20 Nov 202126 Nov 2021

Conference

Conference24th International Symposium on Formal Methods, FM 2021
CityVirtual, Online
Period20/11/202126/11/2021
SeriesLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume13047 LNCS
ISSN0302-9743

Cite this