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篇论文的施引文献,订阅后可以查看论文全部施引文献