对抗性网络物理系统的结构化证明
Structured Proofs for Adversarial Cyber-Physical Systems
摘要:
许多网络物理系统(CPS)是安全关键的,因此形式化地验证它们是很重要的,例如,在形式逻辑中显示模型的正确性规范始终保持。构造性微分博弈逻辑(CdGL)是一种用于(构造性)混合博弈(包括混合系统)的逻辑。为了克服不可判定性,用户首先写一个证明,我们提出了一个证明检查工具。我们介绍Kaisar,第一个语言和工具的CdGL证明,到目前为止,只能用一个低层次的证明演算手工编写。Kaisar的结构化证明简化了具有挑战性的CPS证明任务,特别是通过使用程序设计语言原则和高级状态推理。Kaisar利用CdGL的构造性和细化关系来构建游戏策略模型的证明。该评估再现并扩展了现有的1D和2D驾驶案例研究。证据指标进行了比较,并报告的经验进行了讨论,为原来的研究和他们的复制品。
英文摘要:
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 written by hand with a low-level proof calculus. Kaisar's structured proofs simplify challenging CPS proof tasks, especially by using programming language principles and high-level stateful reasoning. Kaisar exploits CdGL's constructivity and refinement relations to build proofs around models of game strategies. The evaluation reproduces and extends existing case studies on 1D and 2D driving. Proof metrics are compared and reported experiences are discussed for the original studies and their reproductions.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。