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

27 citations · 101 across the 22 of their papers we have counts for

collaborators
Showing cs.PLShow all

7 papers · 1 filter

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…

cs.PL2020★ 13 cited

Removing Algebraic Data Types from Constrained Horn Clauses Using Difference Predicates

Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi +1

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

cs.PL2018★ 3 cited

Bounded Symbolic Execution for Runtime Error Detection of Erlang Programs

Emanuele De Angelis, Fabio Fioravanti, Adrián Palacios +2

Dynamically typed languages, like Erlang, allow developers to quickly write programs without explicitly providing any type information on expressions or function definitions. Howev…

cs.PL2013★ 6 cited

Verification of Imperative Programs by Constraint Logic Program Transformation

Emanuele De Angelis, Fabio Fioravanti, Alberto Pettorossi +1

We present a method for verifying partial correctness properties of imperative programs that manipulate integers and arrays by using techniques based on the transformation of const…

cs.PL2010★ 1 cited

Transformations of Logic Programs on Infinite Lists

Alberto Pettorossi, Maurizio Proietti, Valerio Senni

We consider an extension of logic programs, called ω-programs, that can be used to define predicates over infinite lists. ω-programs allow us to specify properties of the infinite…

cs.PL2004

Transformation Rules for Locally Stratified Constraint Logic Programs

Fabio Fioravanti, Alberto Pettorossi, Maurizio Proietti

We propose a set of transformation rules for constraint logic programs with negation. We assume that every program is locally stratified and, thus, it has a unique perfect model. W…

cs.PL2003

Derivation of Efficient Logic Programs by Specialization and Reduction of Nondeterminism

Alberto Pettorossi, Maurizio Proietti, Sophie Renault

Program specialization is a program transformation methodology which improves program efficiency by exploiting the information about the input data which are available at compile t…