activity
20032023
most citedSolving Horn Clauses on Inductive Data Types Without Induction

27 citations · 107 across the 25 of their papers we have counts for

collaborators

26 papers

cs.AI2023★ 2 cited

Learning Assumption-based Argumentation Frameworks

Maurizio Proietti, Francesca Toni

We propose a novel approach to logic-based learning which generates assumption-based argumentation (ABA) frameworks from positive and negative examples, using a given background kn…

cs.LO2022★ 1 cited

Contract Strengthening through Constrained Horn Clause Verification

Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi +1

The functional properties of a program are often specified by providing a contract for each of its functions. A contract of a function consists of a pair of formulas, called a prec…

cs.PL2022

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

Geoffrey W. Hamilton, Temesghen Kahsai, Maurizio Proietti

These proceedings include selected papers presented at the 9th Workshop on Horn Clauses for Verification and Synthesis and the Tenth International Workshop on Verification and Prog…

cs.LO2022★ 1 cited

Multiple Query Satisfiability of Constrained Horn Clauses

Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi +1

We address the problem of checking the satisfiability of a set of constrained Horn clauses (CHCs) possibly including more than one query. We propose a transformation technique that…

cs.LO2022★ 11 cited

Verifying Catamorphism-Based Contracts using Constrained Horn Clauses

Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi +1

We address the problem of verifying that the functions of a program meet their contracts, specified by pre/postconditions. We follow an approach based on constrained Horn clauses (…

cs.PL2021

Satisfiability of Constrained Horn Clauses on Algebraic Data Types: A Transformation-based Approach

Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi +1

We address the problem of checking the satisfiability of Constrained Horn Clauses (CHCs) defined on Algebraic Data Types (ADTs), such as lists and trees. We propose a new technique…