Conference Proceedings

Convex polyhedral abstractions, specialisation and property-based predicate splitting in Horn clause verification

J Gallagher, K Bishoksan

Electronic Proceedings in Theoretical Computer Science | eptcs | Published : 2014

Abstract

We present an approach to constrained Horn clause (CHC) verification combining three techniques: abstract interpretation over a domain of convex polyhedra, specialisation of the constraints in CHCs using abstract interpretation of query-answer transformed clauses, and refinement by splitting predicates. The purpose of the work is to investigate how analysis and transformation tools developed for constraint logic programs (CLP) can be applied to the Horn clause verification problem. Abstract interpretation over convex polyhedra is capable of deriving sophisticated invariants and when used in conjunction with specialisation for propagating constraints it can frequently solve challenging verifi..

View full abstract

Citation metrics