arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2209.04052cs.SE
收藏

通过有界可满足性检查实现法律合规性的早期验证

Early Verification of Legal Compliance via Bounded Satisfiability Checking

Nick Feng, Lina Marsso, Mehrdad Sabetzadeh, Marsha Chechik

AI总结:

本文提出一种基于 SMT 的有界可满足性检查方法,用于在早期需求阶段验证 MFOTL 形式化的法律合规性,并在多个领域案例中证明其能高效判定合规或生成反例。

摘要:

法律性质涉及对数据值和时间的推理。度量一阶时序逻辑(MFOTL)为指定法律性质提供了丰富的形式化方法。虽然 MFOTL 已通过运行时监控成功用于验证运行系统中的法律性质,但在由需求捕获的早期系统开发阶段,尚不存在基于 MFOTL 的验证方案。给定一个法律性质和系统需求,二者均以 MFOTL 形式化,可以通过可满足性检查在需求上验证该性质的合规性。本文提出了一种实用的、可靠的且在给定界限内完备的 MFOTL 可满足性检查方法。该方法基于可满足性模理论(SMT),采用反例引导策略逐步搜索满足解。我们使用 Z3 SMT 求解器实现了该方法,并在涵盖医疗、工商管理、银行和航空领域的五个案例研究中进行了评估。结果表明,我们的方法能够高效地判定所关注的法律性质是否得到满足,或生成导致合规性违规的反例。

英文摘要:

Legal properties involve reasoning about data values and time. Metric first-order temporal logic (MFOTL) provides a rich formalism for specifying legal properties. While MFOTL has been successfully used for verifying legal properties over operational systems via runtime monitoring, no solution exists for MFOTL-based verification in early-stage system development captured by requirements. Given a legal property and system requirements, both formalized in MFOTL, the compliance of the property can be verified on the requirements via satisfiability checking. In this paper, we propose a practical, sound, and complete (within a given bound) satisfiability checking approach for MFOTL. The approach, based on satisfiability modulo theories (SMT), employs a counterexample-guided strategy to incrementally search for a satisfying solution. We implemented our approach using the Z3 SMT solver and evaluated it on five case studies spanning the healthcare, business administration, banking and aviation domains. Our results indicate that our approach can efficiently determine whether legal properties of interest are met, or generate counterexamples that lead to compliance violations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑