超安全性的证明
Proving Hypersafety Compositionally
摘要:
元$n$的超安全属性是与程序的$n$跟踪(或更一般地,$n$程序的跟踪)相关的程序属性。经典的例子包括决定论、恒等式和结合论。已经引入了许多关系程序逻辑来针对这类属性。他们的目标是通过利用$n$相关程序之间的结构相似性来构造更简单的证明。我们提出了一个未探索的,互补的证明原则,建立超三元组(即超安全判断)作为一个统一的组合积木的证明,我们用它来开发一个逻辑超三元组组成(LHC),支持形式的证明组合性,在以前的逻辑是无法实现的。我们证明了LHC的声音,并将其应用到一些具有挑战性的例子。
英文摘要:
Hypersafety properties of arity $n$ are program properties that relate $n$ traces of a program (or, more generally, traces of $n$ programs). Classic examples include determinism, idempotence, and associativity. A number of relational program logics have been introduced to target this class of properties. Their aim is to construct simpler proofs by capitalizing on structural similarities between the $n$ related programs. We propose an unexplored, complementary proof principle that establishes hyper-triples (i.e. hypersafety judgments) as a unifying compositional building block for proofs, and we use it to develop a Logic for Hyper-triple Composition (LHC), which supports forms of proof compositionality that were not achievable in previous logics. We prove LHC sound and apply it to a number of challenging examples.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。