413 citations
Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.
- University of Rome Tor VergataIT38 papers
- Istituto di Analisi dei Sistemi ed Informatica Antonio RubertiIT19 papers
- Sapienza University of RomeIT18 papers
- University of PerugiaIT16 papers
- University of RostockDE11 papers
- National Research CouncilLK10 papers
- University of L'AquilaIT10 papers
- Centre National de la Recherche ScientifiqueFR9 papers
- Politecnico di MilanoIT9 papers
- The University of TokyoJP9 papers
- University of CagliariIT9 papers
- University of PaduaIT9 papers
13 papers · 1 filter
Optimal matching for sharing and linearity analysis
Gianluca Amato, Francesca Scozzari
Static analysis of logic programs by abstract interpretation requires designing abstract operators which mimic the concrete ones, such as unification, renaming and projection. In t…
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…
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…
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…
Timed Soft Concurrent Constraint Programs: An Interleaved and a Parallel Approach
Stefano Bistarelli, Maurizio Gabbrielli, Maria Chiara Meo +1
We propose a timed and soft extension of Concurrent Constraint Programming. The time extension is based on the hypothesis of bounded asynchrony: the computation takes a bounded per…
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…
Unfolding for CHR programs
Maurizio Gabbrielli, Maria Chiara Meo, Paolo Tacchella +1
Program transformation is an appealing technique which allows to improve run-time efficiency, space-consumption, and more generally to optimize a given program. Essentially, it con…
Optimal multi-binding unification for sharing and linearity analysis
Gianluca Amato, Francesca Scozzari
In the analysis of logic programs, abstract domains for detecting sharing properties are widely used. Recently the new domain $\Linp$ has been introduced to generalize both sharing…
On the interaction between sharing and linearity
Gianluca Amato, Francesca Scozzari
In the analysis of logic programs, abstract domains for detecting sharing and linearity information are widely used. Devising abstract unification algorithms for such domains has p…
A compositional Semantics for CHR
Maurizio Gabbrielli, Maria Chiara Meo
Constraint Handling Rules (CHR) are a committed-choice declarative language which has been designed for writing constraint solvers. A CHR program consists of multi-headed guarded r…
Optimality in Goal-Dependent Analysis of Sharing
Gianluca Amato, Francesca Scozzari
We face the problems of correctness, optimality and precision for the static analysis of logic programs, using the theory of abstract interpretation. We propose a framework with a…
Soft Concurrent Constraint Programming
S. Bistarelli, U. Montanari, F. Rossi
Soft constraints extend classical constraints to represent multiple consistency levels, and thus provide a way to express preferences, fuzziness, and uncertainty. While there are m…
Transformations of CCP programs
Sandro Etalle, Maurizio Gabbrielli, Maria Chiara Meo
We introduce a transformation system for concurrent constraint programming (CCP). We define suitable applicability conditions for the transformations which guarantee that the input…