Implicit and Explicit Proof Management in KeYmaera X

by   Stefan Mitsch, et al.

Hybrid systems theorem proving provides strong correctness guarantees about the interacting discrete and continuous dynamics of cyber-physical systems. The trustworthiness of proofs rests on the soundness of the proof calculus and its correct implementation in a theorem prover. Correctness is easier to achieve with a soundness-critical core that is stripped to the bare minimum, but, as a consequence, proof convenience has to be regained outside the soundness-critical core with proof management techniques. We present modeling and proof management techniques that are built on top of the soundness-critical core of KeYmaera X to enable expanding definitions, parametric proofs, lemmas, and other useful proof techniques in hybrid systems proofs. Our techniques steer the uniform substitution implementation of the differential dynamic logic proof calculus in KeYmaera X to allow users choose when and how in a proof abstract formulas, terms, or programs become expanded to their concrete definitions, and when and how lemmas and sub-proofs are combined to a full proof. The same techniques are exploited in implicit sub-proofs (without making such sub-proofs explicit to the user) to provide proof features, such as temporarily hiding formulas, which are notoriously difficult to get right when implemented in the prover core, but become trustworthy as proof management techniques outside the core. We illustrate our approach with several useful proof techniques and discuss their presentation on the KeYmaera X user interface.


page 1

page 2

page 3

page 4


Structured Proofs for Adversarial Cyber-Physical Systems

Many cyber-physical systems (CPS) are safety-critical, so it is importan...

Certified Connection Tableaux Proofs for HOL Light and TPTP

In the recent years, the Metis prover based on ordered paramodulation an...

Controlling unfolding in type theory

We present a novel mechanism for controlling the unfolding of definition...

EKSTRAKTO A tool to reconstruct Dedukti proofs from TSTP files (extended abstract)

Proof assistants often call automated theorem provers to prove subgoals....

Toward Structured Proofs for Dynamic Logics

We present Kaisar, a structured interactive proof language for different...

Synthesizing Nested Relational Queries from Implicit Specifications

Derived datasets can be defined implicitly or explicitly. An implicit de...

Uniform Substitution for Dynamic Logic with Communicating Hybrid Programs

This paper introduces a uniform substitution calculus for dℒ_CHP, the dy...

Please sign up or login with your details

Forgot password? Click here to reset