Proceedings 9th Workshop on Horn Clauses for Verification and Synthesis  and 10th International Workshop on  Verification and Program Transformation

Hamilton, Geoffrey William; Kahsai, Temesghen; Proietti, Maurizio

doi:10.4204/eptcs.373.0

Cited by 3 publications

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Constrained Horn Clauses Satisfiability via Catamorphic Abstractions

De Angelis,

Fioravanti,

Pettorossi

et al. 2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Catamorphisms are functions that are recursively defined on list and trees and, in general, on Algebraic Data Types (ADTs), and are often used to compute suitable abstractions of programs that manipulate ADTs. Examples of catamorphisms include functions that compute size of lists, orderedness of lists, and height of trees. It is well known that program properties specified through catamorphisms can be proved by showing the satisfiability of suitable sets of Constrained Horn Clauses (CHCs). We address the problem of checking the satisfiability of those sets of CHCs, and we propose a method for transforming sets of CHCs into equisatisfiable sets where catamorphisms are no longer present. As a consequence, clauses with catamorphisms can be handled without extending the satisfiability algorithms used by existing CHC solvers. Through an experimental evaluation on a non-trivial benchmark consisting of many list and tree processing algorithms expressed as sets of CHCs, we show that our technique is indeed effective and significantly enhances the performance of state-of-the-art CHC solvers.

show abstract

Constrained Horn Clauses Satisfiability via Catamorphic Abstractions

De Angelis,

Fioravanti,

Pettorossi

et al. 2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

Boosting Constrained Horn Solving by Unsat Core Learning

Abdulla,

Liang,

Rümmer

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Catamorphic Abstractions for Constrained Horn Clause Satisfiability

DE ANGELIS,

FIORAVANTI,

PETTOROSSI

et al. 2024

Theory and Practice of Logic Programming

View full text Add to dashboard Cite

Catamorphisms are functions that are recursively defined on list and trees and, in general, on algebraic data types (ADTs), and are often used to compute suitable abstractions of programs that manipulate ADTs. Examples of catamorphisms include functions that compute size of lists, orderedness of lists, and height of trees. It is well known that program properties specified through catamorphisms can be proved by showing the satisfiability of suitable sets of constrained Horn clauses (CHCs). We address the problem of checking the satisfiability of those sets of CHCs, and we propose a method for transforming sets of CHCs into equisatisfiable sets where catamorphisms are no longer present. As a consequence, clauses with catamorphisms can be handled without extending the satisfiability algorithms used by existing CHC solvers. Through an experimental evaluation on a nontrivial benchmark consisting of many list and tree processing algorithms expressed as sets of CHCs, we show that our technique is indeed effective and significantly enhances the performance of state-of-the-art CHC solvers.

show abstract

Proceedings 9th Workshop on Horn Clauses for Verification and Synthesis and 10th International Workshop on Verification and Program Transformation

Cited by 3 publications

References 0 publications

Constrained Horn Clauses Satisfiability via Catamorphic Abstractions

Constrained Horn Clauses Satisfiability via Catamorphic Abstractions

Boosting Constrained Horn Solving by Unsat Core Learning

Catamorphic Abstractions for Constrained Horn Clause Satisfiability

Contact Info

Product

Resources

About