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

Bishoksan Kafle, John Patrick Gallagher

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

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 verification problems. This is a contribution in itself, but refinement is needed when it fails, and the question of how to refine convex polyhedral analyses has not been studied much. We present a refinement technique based on interpolants derived from a counterexample trace; these are used to drive a property-based specialisation that splits predicates, leading in turn to more precise convex polyhedral analyses. The process of specialisation, analysis and splitting can be repeated, in a manner similar to the CEGAR and iterative specialisation approaches.
Original languageEnglish
Title of host publicationProceedings First Workshop on Horn Clauses for Verification and Synthesis
EditorsNikolaj Bjørner, Fabio Fioravanti, Andrey Rybalchenko, Valerio Senni
Number of pages15
Volume169
PublisherEPTCS
Publication date2 Dec 2014
Pages53-67
Article number7
DOIs
Publication statusPublished - 2 Dec 2014
EventFirst Workshop on Horn Clauses for Verification and Synthesis - Vienna, Austria
Duration: 17 Jul 201417 Jul 2014

Conference

ConferenceFirst Workshop on Horn Clauses for Verification and Synthesis
CountryAustria
CityVienna
Period17/07/201417/07/2014

Keywords

  • constrained Horn clause
  • convex polyhedral abstraction
  • specialisation

Cite this

Kafle, B., & Gallagher, J. P. (2014). Convex polyhedral abstractions, specialisation and property-based predicate splitting in Horn clause verification. In N. Bjørner, F. Fioravanti, A. Rybalchenko, & V. Senni (Eds.), Proceedings First Workshop on Horn Clauses for Verification and Synthesis (Vol. 169, pp. 53-67). [7] EPTCS. https://doi.org/10.4204/EPTCS.169.7
Kafle, Bishoksan ; Gallagher, John Patrick. / Convex polyhedral abstractions, specialisation and property-based predicate splitting in Horn clause verification. Proceedings First Workshop on Horn Clauses for Verification and Synthesis. editor / Nikolaj Bjørner ; Fabio Fioravanti ; Andrey Rybalchenko ; Valerio Senni. Vol. 169 EPTCS, 2014. pp. 53-67
@inproceedings{5c72f88fd0934c8192c8cad970b09adf,
title = "Convex polyhedral abstractions, specialisation and property-based predicate splitting in Horn clause verification",
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 verification problems. This is a contribution in itself, but refinement is needed when it fails, and the question of how to refine convex polyhedral analyses has not been studied much. We present a refinement technique based on interpolants derived from a counterexample trace; these are used to drive a property-based specialisation that splits predicates, leading in turn to more precise convex polyhedral analyses. The process of specialisation, analysis and splitting can be repeated, in a manner similar to the CEGAR and iterative specialisation approaches.",
keywords = "constrained Horn clause, convex polyhedral abstraction, specialisation",
author = "Bishoksan Kafle and Gallagher, {John Patrick}",
year = "2014",
month = "12",
day = "2",
doi = "10.4204/EPTCS.169.7",
language = "English",
volume = "169",
pages = "53--67",
editor = "Nikolaj Bj{\o}rner and Fabio Fioravanti and Andrey Rybalchenko and Valerio Senni",
booktitle = "Proceedings First Workshop on Horn Clauses for Verification and Synthesis",
publisher = "EPTCS",

}

Kafle, B & Gallagher, JP 2014, Convex polyhedral abstractions, specialisation and property-based predicate splitting in Horn clause verification. in N Bjørner, F Fioravanti, A Rybalchenko & V Senni (eds), Proceedings First Workshop on Horn Clauses for Verification and Synthesis. vol. 169, 7, EPTCS, pp. 53-67, First Workshop on Horn Clauses for Verification and Synthesis , Vienna, Austria, 17/07/2014. https://doi.org/10.4204/EPTCS.169.7

Convex polyhedral abstractions, specialisation and property-based predicate splitting in Horn clause verification. / Kafle, Bishoksan; Gallagher, John Patrick.

Proceedings First Workshop on Horn Clauses for Verification and Synthesis. ed. / Nikolaj Bjørner; Fabio Fioravanti; Andrey Rybalchenko; Valerio Senni. Vol. 169 EPTCS, 2014. p. 53-67 7.

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

TY - GEN

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

AU - Kafle, Bishoksan

AU - Gallagher, John Patrick

PY - 2014/12/2

Y1 - 2014/12/2

N2 - 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 verification problems. This is a contribution in itself, but refinement is needed when it fails, and the question of how to refine convex polyhedral analyses has not been studied much. We present a refinement technique based on interpolants derived from a counterexample trace; these are used to drive a property-based specialisation that splits predicates, leading in turn to more precise convex polyhedral analyses. The process of specialisation, analysis and splitting can be repeated, in a manner similar to the CEGAR and iterative specialisation approaches.

AB - 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 verification problems. This is a contribution in itself, but refinement is needed when it fails, and the question of how to refine convex polyhedral analyses has not been studied much. We present a refinement technique based on interpolants derived from a counterexample trace; these are used to drive a property-based specialisation that splits predicates, leading in turn to more precise convex polyhedral analyses. The process of specialisation, analysis and splitting can be repeated, in a manner similar to the CEGAR and iterative specialisation approaches.

KW - constrained Horn clause

KW - convex polyhedral abstraction

KW - specialisation

U2 - 10.4204/EPTCS.169.7

DO - 10.4204/EPTCS.169.7

M3 - Article in proceedings

VL - 169

SP - 53

EP - 67

BT - Proceedings First Workshop on Horn Clauses for Verification and Synthesis

A2 - Bjørner, Nikolaj

A2 - Fioravanti, Fabio

A2 - Rybalchenko, Andrey

A2 - Senni, Valerio

PB - EPTCS

ER -

Kafle B, Gallagher JP. Convex polyhedral abstractions, specialisation and property-based predicate splitting in Horn clause verification. In Bjørner N, Fioravanti F, Rybalchenko A, Senni V, editors, Proceedings First Workshop on Horn Clauses for Verification and Synthesis. Vol. 169. EPTCS. 2014. p. 53-67. 7 https://doi.org/10.4204/EPTCS.169.7