RUS  ENG
Full version
JOURNALS // Modelirovanie i Analiz Informatsionnykh Sistem // Archive

Model. Anal. Inform. Sist., 2018 Volume 25, Number 5, Pages 465–480 (Mi mais642)

This article is cited in 1 paper

Program Verification

A control flow graph based approach to make the verification of cyber-physical systems using KeYmaera easier

T. Baara, S. Staroletovb

a Hochschule für Technik und Wirtschaft Berlin University of Applied Sciences, Germany 75 A Wilhelminenhofstrasse, D-12459, Berlin, Germany
b Polzunov Altai State Technical University, 46 Lenina avenue, Barnaul, Altai region, 656038 Russian Federation

Abstract: KeYmaera is an interactive theorem prover and is used to verify safety properties of cyber-physical systems (CPSs). It implements a Dynamic Logic for Hybrid Programs (HPs), while a HP models a CPS very precisely. Verifying properties of a given system in KeYmaera can become a challenge for a user since the proof is authored in a classical sequent calculus framework and a successful proof requires from the user intimate knowledge of the available calculus rules. Another barrier for widespread application of KeYmaera is the purely textual representation of current proof goals, what requires from the user very good training, experience, and patience.
In this paper, we present an alternative verification approach based on KeYmaera, which drastically improves usability and minimizes user interaction. The main idea is to let the user annotate invariants and contracts to states of the hybrid automaton.
Thus, the user can employ the graphical representation of the modelled system and is not bound to the purely textual form of hybrid programs as in KeYmaera. Based on the user-provided contracts, one can generate proof obligations, which are much simpler than the original proof goal in KeYmaera.
The article is published in the authors' wording.

Keywords: CPS, KeYmaera, proof contracts, verification, hybrid systems, usability, interactive provers.

UDC: 004.942

Received: 10.09.2018

Language: English

DOI: 10.18255/1818-1015-465-480



© Steklov Math. Inst. of RAS, 2024