层次框图变换的确定性的机械证明
Mechanically Proving Determinacy of Hierarchical Block Diagram Translations
摘要:
分层框图(HBD)是嵌入式系统设计工具(包括Simulink)的核心。存在许多从HBD到具有形式语义的语言的翻译,服从形式化验证。然而,据我们所知,这些翻译都没有被证明是正确的。我们在本文中提出的第一个机械证明HBD翻译算法。该算法将HBD转换为具有三个基本组合操作(串行,并行和反馈)的项的代数。为了捕捉不同的翻译策略,导致不同的条款实现不同的权衡,该算法是不确定的。尽管如此,我们证明了它的语义确定性:对于每个输入HBD,所有可能的条款,可以生成的算法是语义等价的。我们应用这个结果来说明如何三个Simulink翻译策略介绍以前可以正式确定的算法,并得出这些策略产生语义等价的结果(在以前的工作中留下的问题)。所有的结果被形式化,并证明在伊莎贝尔定理证明。
英文摘要:
Hierarchical block diagrams (HBDs) are at the heart of embedded system design tools, including Simulink. Numerous translations exist from HBDs into languages with formal semantics, amenable to formal verification. However, none of these translations has been proven correct, to our knowledge. We present in this paper the first mechanically proven HBD translation algorithm. The algorithm translates HBDs into an algebra of terms with three basic composition operations (serial, parallel, and feedback). In order to capture various translation strategies resulting in different terms achieving different tradeoffs, the algorithm is nondeterministic. Despite this, we prove its semantic determinacy: for every input HBD, all possible terms that can be generated by the algorithm are semantically equivalent. We apply this result to show how three Simulink translation strategies introduced previously can be formalized as determinizations of the algorithm, and derive that these strategies yield semantically equivalent results (a question left open in previous work). All results are formalized and proved in the Isabelle theorem-prover.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。