Abstract
AbstractWe address the problem of verifying the satisfiability of Constrained Horn Clauses (CHCs) based on theories of inductively defined data structures, such as lists and trees. We propose a transformation technique whose objective is the removal of these data structures from CHCs, hence reducing their satisfiability to a satisfiability problem for CHCs on integers and booleans. We propose a transformation algorithm and identify a class of clauses where it always succeeds. We also consider an extension of that algorithm, which combines clause transformation with reasoning on integer constraints. Via an experimental evaluation we show that our technique greatly improves the effectiveness of applying the Z3 solver to CHCs. We also show that our verification technique based on CHC transformation followed by CHC solving, is competitive with respect to CHC solvers extended with induction.
Publisher
Cambridge University Press (CUP)
Subject
Artificial Intelligence,Computational Theory and Mathematics,Hardware and Architecture,Theoretical Computer Science,Software
Reference35 articles.
1. Mordvinov D. and Fedyukovich G. 2017. Synchronizing constrained Horn clauses. In Proc. of LPAR-21 EPiC Series in Computing Vol. 46. EasyChair, 338–355.
2. De Angelis E. , Fioravanti F. , Pettorossi A. , and Proietti M. 2017a. Predicate pairing for program verification. Theory and Practice of Logic Programming, 1–41. Published online, to appear in press (https://arxiv.org/abs/1708.01473).
3. Hojjat H. , Konecný F. , Garnier F. , Iosif R. , Kuncak V. , and Rümmer P. 2012. A verification toolkit for numerical transition systems. In Proc. of FM '12, LNCS 7436. Springer, 247–251.
4. Cousot P. and Halbwachs N. 1978. Automatic discovery of linear restraints among variables of a program. In Proc. of POPL '78. ACM, 84–96.
5. De Angelis E. , Fioravanti F. , Pettorossi A. , and Proietti M. 2016. Relational verification through Horn clause transformation. In Proc. of SAS '16, LNCS 9837. Springer, 147–169.
Cited by
22 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献