Optimal CHC Solving via Termination Proofs

Author:

Gu Yu1ORCID,Tsukada Takeshi2ORCID,Unno Hiroshi3ORCID

Affiliation:

1. University of Tsukuba, Japan

2. Chiba University, Japan

3. University of Tsukuba, Japan / RIKEN AIP, Japan

Abstract

Motivated by applications to open program reasoning such as maximal specification inference, this paper studies optimal CHC solving , a problem to compute maximal and/or minimal solutions of constrained Horn clauses (CHCs). This problem and its subproblems have been studied in the literature, and a major approach is to iteratively improve a solution of CHCs until it becomes optimal. So a key ingredient of optimization methods is the optimality checking of a given solution. We propose a novel optimality checking method, as well as an optimization method using the proposed optimality checker, based on a computational theoretical analysis of the optimality checking problem. The key observation is that the optimality checking problem is closely related to the termination analysis of programs, and this observation is useful both theoretically and practically. From a theoretical perspective, it clarifies a limitation of an existing method and incorrectness of another method in the literature. From a practical perspective, it allows us to apply techniques of termination analysis to the optimality checking of a solution of CHCs. We present an optimality checking method based on constraint-based synthesis of termination arguments, implemented our method, evaluated it on CHCs that encode maximal specification synthesis problems, and obtained promising results.

Funder

Japan Society for the Promotion of Science

Publisher

Association for Computing Machinery (ACM)

Subject

Safety, Risk, Reliability and Quality,Software

Reference35 articles.

1. Aws Albarghouthi Isil Dillig and Arie Gurfinkel. 2016. Maximal Specification Synthesis. In POPL ’16. ACM 789–801. Aws Albarghouthi Isil Dillig and Arie Gurfinkel. 2016. Maximal Specification Synthesis. In POPL ’16. ACM 789–801.

2. Christophe Alias , Alain Darte , Paul Feautrier , and Laure Gonnord . 2010. Multi-dimensional Rankings, Program Termination , and Complexity Bounds of Flowchart Programs . In SAS ’10 . Springer , 117–133. Christophe Alias, Alain Darte, Paul Feautrier, and Laure Gonnord. 2010. Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs. In SAS ’10. Springer, 117–133.

3. Ranking Functions for Linear-Constraint Loops

4. Amir M. Ben-Amram and Samir Genaim . 2017 . On Multiphase-Linear Ranking Functions. In CAV ’17. Springer , 601–620. Amir M. Ben-Amram and Samir Genaim. 2017. On Multiphase-Linear Ranking Functions. In CAV ’17. Springer, 601–620.

5. Tewodros Beyene Swarat Chaudhuri Corneliu Popeea and Andrey Rybalchenko. 2014. A Constraint-based Approach to Solving Games on Infinite Graphs. In POPL ’14. ACM 221–233. Tewodros Beyene Swarat Chaudhuri Corneliu Popeea and Andrey Rybalchenko. 2014. A Constraint-based Approach to Solving Games on Infinite Graphs. In POPL ’14. ACM 221–233.

Cited by 4 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3