Forward Invariant Cuts to Simplify Proofs of Safety
Nikos Arechiga, James Kapinski, Jyotirmoy Deshmukh, Andre Platzer,, Bruce Krogh

TL;DR
This paper introduces a new proof technique called forward invariant cuts for the KeYmaera theorem prover, enabling more automated and effective safety verification of hybrid systems by leveraging system invariants discovered through numerical methods.
Contribution
It extends KeYmaera with a forward invariant cut rule and a methodology to discover useful invariants, improving the automation and scope of safety proofs for hybrid systems.
Findings
Enables verification of complex hybrid systems previously out of reach.
Integrates numerical invariant discovery with deductive proof techniques.
Demonstrates effectiveness on automotive powertrain control system case study.
Abstract
The use of deductive techniques, such as theorem provers, has several advantages in safety verification of hybrid sys- tems; however, state-of-the-art theorem provers require ex- tensive manual intervention. Furthermore, there is often a gap between the type of assistance that a theorem prover requires to make progress on a proof task and the assis- tance that a system designer is able to provide. This paper presents an extension to KeYmaera, a deductive verification tool for differential dynamic logic; the new technique allows local reasoning using system designer intuition about per- formance within particular modes as part of a proof task. Our approach allows the theorem prover to leverage for- ward invariants, discovered using numerical techniques, as part of a proof of safety. We introduce a new inference rule into the proof calculus of KeYmaera, the forward invariant cut rule, and…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
