Tree dimension in verification of constrained Horn clauses

Author:

KAFLE BISHOKSAN,GALLAGHER JOHN P.ORCID,GANTY PIERRE

Abstract

AbstractIn this paper, we show how the notion of tree dimension can be used in the verification of constrained Horn clauses (CHCs). The dimension of a tree is a numerical measure of its branching complexity and the concept here applies to Horn clause derivation trees. Derivation trees of dimension zero correspond to derivations using linear CHCs, while trees of higher dimension arise from derivations using non-linear CHCs. We show how to instrument CHCs predicates with an extra argument for the dimension, allowing a CHC verifier to reason about bounds on the dimension of derivations. Given a set of CHCsP, we define a transformation ofPyielding adimension-boundedset of CHCsPk. The set of derivations forPkconsists of the derivations forPthat have dimension at mostk. We also show how to construct a set of clauses denotedP>kwhose derivations have dimension exceedingk. We then present algorithms using these constructions to decompose a CHC verification problem. One variation of this decomposition considers derivations of successively increasing dimension. The paper includes descriptions of implementations and experimental results.

Publisher

Cambridge University Press (CUP)

Subject

Artificial Intelligence,Computational Theory and Mathematics,Hardware and Architecture,Theoretical Computer Science,Software

Reference36 articles.

1. Computer Aided Verification

2. Peralta J. , Gallagher J. P. and Sağlam H. 1998. Analysis of imperative programs through analysis of constraint logic programs. In Proc. of International Static Analysis Symposium (SAS), G. Levi , Ed. Lecture Notes in Computer Science, vol. 1503. Springer-Verlag, 246–261.

3. Mordvinov D. and Fedyukovich G. 2017. Synchronizing constrained horn clauses. In Proc. of 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning (LPAR-21), T. Eiter and D. Sands , Eds. EPiC Series in Computing, vol. 46. EasyChair, 338–355.

4. Rümmer P. , Hojjat H. and Kuncak V. 2013. Disjunctive interpolants for Horn-clause verification. In Proc. of Computer-Aided Verification, N. Sharygina and H. Veith , Eds. Lecture Notes in Computer Science, vol 8044. Springer, 347–363.

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

1. Analysis and Transformation of Constrained Horn Clauses for Program Verification;Theory and Practice of Logic Programming;2021-11-15

2. Prolog for Verification, Analysis and Transformation Tools;Electronic Proceedings in Theoretical Computer Science;2020-08-07

3. From Big-Step to Small-Step Semantics and Back with Interpreter Specialisation;Electronic Proceedings in Theoretical Computer Science;2020-08-07

4. Polyvariant Program Specialisation with Property-based Abstraction;Electronic Proceedings in Theoretical Computer Science;2019-08-20

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP

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