Structured Proofs for Adversarial Cyber-Physical Systems

  title={Structured Proofs for Adversarial Cyber-Physical Systems},
  author={Brandon Bohrer and Andr{\'e} Platzer},
  journal={ACM Transactions on Embedded Computing Systems (TECS)},
  pages={1 - 26}
Many cyber-physical systems (CPS) are safety-critical, so it is important to formally verify them, e.g. in formal logics that show a model’s correctness specification always holds. Constructive Differential Game Logic (CdGL) is such a logic for (constructive) hybrid games, including hybrid systems. To overcome undecidability, the user first writes a proof, for which we present a proof-checking tool. We introduce Kaisar, the first language and tool for CdGL proofs, which until now could only be… 

Figures and Tables from this paper


Thesis Proposal Practical End-to-End Verification of Cyber-Physical Systems
This thesis addresses implementation and soundness gaps by using constructive logic and programming languages as the foundation of an end-to-end verification toolchain of cyber-physical systems called Constructive Differential Game Logic ( CdGL).
VeriPhy: verified controller executables from verified cyber-physical system models
VeriPhy proves that all safety results are preserved end-to-end as it bridges abstraction gaps, as it automatically transforms verified high-level models of safety-critical cyber-physical systems (CPSs) in differential dynamic logic (dL) to verified controller executables.
Formal Verification of Stability Properties of Cyber-physical Systems
This work describes and contrast two approaches for proving the stability of the linear, one-dimensional proportional controller (P-controller) depicted in Figure 1, and presents an overview of the experiences formalizing stability properties of cyber-physical systems (CPSs) using the Coq proof assistant.
A Formal Safety Net for Waypoint-Following in Ground Robots
We present a reusable formally verified safety net that provides end-to-end safety and liveness guarantees for two-dimensional waypoint-following of Dubins-type ground robots with tolerances and
Differential Refinement Logic*
  • Sarah M. Loos, A. Platzer
  • Computer Science
    2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
  • 2016
dRℒ is introduced, a logic with first-class support for refinement relations on hybrid systems, and a proof calculus for verifying such relations, and its usefulness is demonstrated with examples where using refinement results in easier and better-structured proofs.
Differential Game Logic
  • A. Platzer
  • Computer Science
    ACM Trans. Comput. Log.
  • 2015
The logic dGL is proved to be strictly more expressive than the corresponding logic of hybrid systems by characterizing the expressiveness of both.
Differential Dynamic Logic for Hybrid Systems
  • A. Platzer
  • Computer Science, Mathematics
    Journal of Automated Reasoning
  • 2008
A dynamic logic for hybrid programs is introduced, which is a program notation for hybrid systems with a free variable proof calculus with a novel combination of real-valued free variables and Skolemisation for lifting quantifier elimination for real arithmetic to dynamic logic.
A game theoretic approach to controller design for hybrid systems
This work presents a method to design controllers for safety specifications in hybrid systems, using analysis based on optimal control and game theory for automata and continuous dynamical systems to derive Hamilton-Jacobi equations whose solutions describe the boundaries of reachable sets.
Rectangular Hybrid Games
It is shown that the successively more general infinite-state classes of timed, 2D rectangular, and rectangular games induce successively weaker, but still finite, quotient structures called game bisimilarity, game similarity, and game trace equivalence.
Pegasus: sound continuous invariant generation
Pegasus is developed : an automatic continuous invariant generator which allows for combinations of various methods, and is integrated with the KeYmaera X theorem prover for hybrid systems.