Tree dimension in verification of constrained Horn clauses

DOI10.1017/S1471068418000030zbMATH Open1478.68165arXiv1803.01448OpenAlexW2964124669WikidataQ129837133 ScholiaQ129837133MaRDI QIDQ4644355FDOQ4644355

Authors: Bishoksan Kafle, John P. Gallagher, Pierre Ganty 

Publication date: 31 May 2018

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Abstract: In 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 CHCs $P$, we define a transformation of $P$ yielding a dimension bounded set of CHCs $P^{leqk}$. The set of derivations for $P^{leqk}$ consists of the derivations for $P$ that have dimension at most $k$. We also show how to construct a set of clauses denoted $P^{>k}$ whose derivations have dimension exceeding $k$. 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. Under consideration for publication in Theory and Practice of Logic Programming (TPLP).

Full work available at URL: https://arxiv.org/abs/1803.01448

Recommendations

• Horn clause verification with convex polyhedral abstraction and tree automata-based refinement
• Tree automata-based refinement with application to Horn clause verification
• Solving non-linear Horn clauses using a linear Horn clause solver
• Solving Horn clauses on inductive data types without induction
• scientific article; zbMATH DE number 7444022

zbMATH Keywords

specificationHorn clausestree dimensionanalysis and verification of systems

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Logic in computer science (03B70)

Cites Work

• Combining Widening and Acceleration in Linear Relation Analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• Generalized property directed reachability
• The semantics of constraint logic programs1Note that reviewing of this paper was handled by the Editor-in-Chief.1
• Behavioural differential equations: a coinductive calculus of streams, automata, and power series
• On Fixed Point Equations over Commutative Semirings
• Title not available (Why is that?)
• An overview of Ciao and its design philosophy
• Proving correctness of imperative programs by linearizing constrained Horn clauses
• Refinement of Trace Abstraction
• Horn clause verification with convex polyhedral abstraction and tree automata-based refinement
• Newtonian program analysis via tensor product
• Horn clause solvers for program verification
• Newtonian program analysis
• Solving non-linear Horn clauses using a linear Horn clause solver
• A Brief History of Strahler Numbers
• Synchronizing constrained Horn clauses

Cited In (7)

• Verifying the Correctness of Disjoint-Set Forests with Kleene Relation Algebras
• Analysis and Transformation of Constrained Horn Clauses for Program Verification
• Title not available (Why is that?)
• Tree automata-based refinement with application to Horn clause verification
• Title not available (Why is that?)
• Deciding validity in a spatial logic for trees
• Horn clause verification with convex polyhedral abstraction and tree automata-based refinement

Uses Software

• Yices
• PPL

This page was built for publication: Tree dimension in verification of constrained Horn clauses

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4644355)