Decomposition by tree dimension in Horn clause verification

@inproceedings{Kafle2015DecompositionBT,
  title={Decomposition by tree dimension in Horn clause verification},
  author={Bishoksan Kafle and J. Gallagher and P. Ganty},
  booktitle={VPT@ETAPS},
  year={2015}
}
In this paper we investigate the use of the concept of tree dimension in Horn clause analysis and verification. The dimension of a tree is a measure of its non-linearity - for example a list of any length has dimension zero while a complete binary tree has dimension equal to its height. We apply this concept to trees corresponding to Horn clause derivations. A given set of Horn clauses P can be transformed into a new set of clauses P= k can be obtained from P whose derivation trees have… Expand
1 Citations
Solving non-linear Horn clauses using a linear Horn clause solver

References

SHOWING 1-10 OF 29 REFERENCES
Tree Automata-Based Refinement with Application to Horn Clause Verification
Constraint Specialisation in Horn Clause Verification
A Direct Proof for the Completeness of SLD-Resolution
Synthesis and Transformation of Logic Programs Using Unfold/Fold Proofs
Tree automata techniques and applications
Regular Approximation of Computation Paths in Logic and Functional Languages
An Optimised Algorithm for Determinisation and Completion of Finite Tree Automata
...
1
2
3
...