Rahft

A Tool for Verifying Horn Clauses Using Abstract Interpretation and Finite Tree Automata

Bishoksan Kafle, John Patrick Gallagher, José F. Morales

Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningpeer review

Resumé

We present Rahft (Refinement of Abstraction in Horn clauses using Finite Tree automata), an abstraction refinement tool for verifying safety properties of programs expressed as Horn clauses. The paper describes the architecture, strength and weakness, implementation and usage aspects of the tool. Rahft loosely combines three powerful techniques for program verification: (i) program specialisation, (ii) abstract interpretation, and (iii) trace abstraction refinement in a nontrivial way, with the aim of exploiting their strengths and mitigating their weaknesses through the complementary techniques. It is interfaced with an abstract domain, a tool for manipulating finite tree automata and various solvers for reasoning about constraints. Its modular design and customizable components allows for experimenting with new verification techniques and tools developed for Horn clauses.
OriginalsprogEngelsk
TitelComputer Aided Verification : 28th International Conference, CAV 2016, Toronto, ON, Canada, July 17-23, 2016, Proceedings, Part I
RedaktørerSwarat Chaudhuri, Azadeh Farzan
Antal sider8
Vol/bindPart 1
ForlagSpringer
Publikationsdato2016
Sider261-268
ISBN (Trykt)978-3-319-41527-7
DOI
StatusUdgivet - 2016
Begivenhed28th International Conference on Computer Aided Verification: International Conference - University of Toronto in the the Bahen Centre for Information Technology , Toronto, Canada
Varighed: 17 jul. 201623 jul. 2016
http://i-cav.org/2016/ (Link til konference)

Konference

Konference28th International Conference on Computer Aided Verification
LokationUniversity of Toronto in the the Bahen Centre for Information Technology
LandCanada
ByToronto
Periode17/07/201623/07/2016
Internetadresse
NavnLecture Notes in Computer Science
Nummer9779
ISSN0302-9743

Citer dette

Kafle, B., Gallagher, J. P., & Morales, J. F. (2016). Rahft: A Tool for Verifying Horn Clauses Using Abstract Interpretation and Finite Tree Automata. I S. Chaudhuri, & A. Farzan (red.), Computer Aided Verification : 28th International Conference, CAV 2016, Toronto, ON, Canada, July 17-23, 2016, Proceedings, Part I (Bind Part 1, s. 261-268). Springer. Lecture Notes in Computer Science, Nr. 9779 https://doi.org/10.1007/978-3-319-41528-4_14
Kafle, Bishoksan ; Gallagher, John Patrick ; Morales, José F. / Rahft : A Tool for Verifying Horn Clauses Using Abstract Interpretation and Finite Tree Automata. Computer Aided Verification : 28th International Conference, CAV 2016, Toronto, ON, Canada, July 17-23, 2016, Proceedings, Part I. red. / Swarat Chaudhuri ; Azadeh Farzan. Bind Part 1 Springer, 2016. s. 261-268 (Lecture Notes in Computer Science; Nr. 9779).
@inproceedings{5f2d0d02e70648d39e855adde4135d01,
title = "Rahft: A Tool for Verifying Horn Clauses Using Abstract Interpretation and Finite Tree Automata",
abstract = "We present Rahft (Refinement of Abstraction in Horn clauses using Finite Tree automata), an abstraction refinement tool for verifying safety properties of programs expressed as Horn clauses. The paper describes the architecture, strength and weakness, implementation and usage aspects of the tool. Rahft loosely combines three powerful techniques for program verification: (i) program specialisation, (ii) abstract interpretation, and (iii) trace abstraction refinement in a nontrivial way, with the aim of exploiting their strengths and mitigating their weaknesses through the complementary techniques. It is interfaced with an abstract domain, a tool for manipulating finite tree automata and various solvers for reasoning about constraints. Its modular design and customizable components allows for experimenting with new verification techniques and tools developed for Horn clauses.",
keywords = "Automatic verification, Abstract Interpretation, Horn clauses, finite tree automata",
author = "Bishoksan Kafle and Gallagher, {John Patrick} and Morales, {Jos{\'e} F.}",
year = "2016",
doi = "10.1007/978-3-319-41528-4_14",
language = "English",
isbn = "978-3-319-41527-7",
volume = "Part 1",
pages = "261--268",
editor = "Swarat Chaudhuri and Azadeh Farzan",
booktitle = "Computer Aided Verification",
publisher = "Springer",

}

Kafle, B, Gallagher, JP & Morales, JF 2016, Rahft: A Tool for Verifying Horn Clauses Using Abstract Interpretation and Finite Tree Automata. i S Chaudhuri & A Farzan (red), Computer Aided Verification : 28th International Conference, CAV 2016, Toronto, ON, Canada, July 17-23, 2016, Proceedings, Part I. bind Part 1, Springer, Lecture Notes in Computer Science, nr. 9779, s. 261-268, 28th International Conference on Computer Aided Verification, Toronto, Canada, 17/07/2016. https://doi.org/10.1007/978-3-319-41528-4_14

Rahft : A Tool for Verifying Horn Clauses Using Abstract Interpretation and Finite Tree Automata. / Kafle, Bishoksan; Gallagher, John Patrick; Morales, José F.

Computer Aided Verification : 28th International Conference, CAV 2016, Toronto, ON, Canada, July 17-23, 2016, Proceedings, Part I. red. / Swarat Chaudhuri; Azadeh Farzan. Bind Part 1 Springer, 2016. s. 261-268 (Lecture Notes in Computer Science; Nr. 9779).

Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningpeer review

TY - GEN

T1 - Rahft

T2 - A Tool for Verifying Horn Clauses Using Abstract Interpretation and Finite Tree Automata

AU - Kafle, Bishoksan

AU - Gallagher, John Patrick

AU - Morales, José F.

PY - 2016

Y1 - 2016

N2 - We present Rahft (Refinement of Abstraction in Horn clauses using Finite Tree automata), an abstraction refinement tool for verifying safety properties of programs expressed as Horn clauses. The paper describes the architecture, strength and weakness, implementation and usage aspects of the tool. Rahft loosely combines three powerful techniques for program verification: (i) program specialisation, (ii) abstract interpretation, and (iii) trace abstraction refinement in a nontrivial way, with the aim of exploiting their strengths and mitigating their weaknesses through the complementary techniques. It is interfaced with an abstract domain, a tool for manipulating finite tree automata and various solvers for reasoning about constraints. Its modular design and customizable components allows for experimenting with new verification techniques and tools developed for Horn clauses.

AB - We present Rahft (Refinement of Abstraction in Horn clauses using Finite Tree automata), an abstraction refinement tool for verifying safety properties of programs expressed as Horn clauses. The paper describes the architecture, strength and weakness, implementation and usage aspects of the tool. Rahft loosely combines three powerful techniques for program verification: (i) program specialisation, (ii) abstract interpretation, and (iii) trace abstraction refinement in a nontrivial way, with the aim of exploiting their strengths and mitigating their weaknesses through the complementary techniques. It is interfaced with an abstract domain, a tool for manipulating finite tree automata and various solvers for reasoning about constraints. Its modular design and customizable components allows for experimenting with new verification techniques and tools developed for Horn clauses.

KW - Automatic verification

KW - Abstract Interpretation

KW - Horn clauses

KW - finite tree automata

U2 - 10.1007/978-3-319-41528-4_14

DO - 10.1007/978-3-319-41528-4_14

M3 - Article in proceedings

SN - 978-3-319-41527-7

VL - Part 1

SP - 261

EP - 268

BT - Computer Aided Verification

A2 - Chaudhuri, Swarat

A2 - Farzan, Azadeh

PB - Springer

ER -

Kafle B, Gallagher JP, Morales JF. Rahft: A Tool for Verifying Horn Clauses Using Abstract Interpretation and Finite Tree Automata. I Chaudhuri S, Farzan A, red., Computer Aided Verification : 28th International Conference, CAV 2016, Toronto, ON, Canada, July 17-23, 2016, Proceedings, Part I. Bind Part 1. Springer. 2016. s. 261-268. (Lecture Notes in Computer Science; Nr. 9779). https://doi.org/10.1007/978-3-319-41528-4_14