论文标题

通过有限的可满足性检查对法律合规的早期验证

Early Verification of Legal Compliance via Bounded Satisfiability Checking

论文作者

Feng, Nick, Marsso, Lina, Sabetzadeh, Mehrdad, Chechik, Marsha

论文摘要

法律属性涉及有关数据值和时间的推理。公制的一阶时间逻辑(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.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源