Agostino Cortesi

Learn More
Type analysis of Prolog is of primary importance for high-performance compilers, since type information may lead to better indexing and to sophisticated specializations of unification and built-in predicates to name a few. However, these optimizations often require a sophisticated type inference system capable of inferring disjunctive and recursive types(More)
We revisit the abstract domain Prop for analyzing variable groundness in logic programs. This very elegant domain, introduced by Marriott and Sflndergaard, consists of (equivalence classes of) propositional formula whose propositional variables correspond to program variables with truth assignments indicating which program variables are ground. Some(More)
Abstract interpretation [7] is a systematic methodology to designstatic program analysis which has been studied extensively in the logicprogramming community, because of the potential for optimizations inlogic programming compilers and the sophistication of the analyses whichrequire conceptual support. With the emergence of efficient genericabstract(More)
Digital watermarking for relational databases emerged as a candidate solution to provide copyright protection, tamper detection, traitor tracing, maintaining integrity of relational data. Many watermarking techniques have been proposed in the literature to address these purposes. In this paper, we survey the current state-of-theart and we classify them(More)
Reduced product of abstract domains is a rather well-known operation for domain composition in abstract interpretation. In this article, we study its inverse operation, introducing a notion of domain complementation in abstract interpretation. Complementation provides as systematic way to design new abstract domains, and it allows to systematically(More)
Within the abstract interpretation framework, abstract domains are used to represent interesting properties of the concrete domain. For instance, properties that enhance the optimization of the analyzed programs. An abstract domain D expresses, in general, several properties of the concrete domain. We describe a method for identifying, for any abstract(More)
Interpretation of logic programs: an abstract domain for groundless, sharing, freeness and compoundness analysis Agostino Cortesi and Gilberto Fi16 Dept. of Mathematics University of Padova Via Belzoni 7, 1-35131 Padova ITALY matOl@unipad.infn .it Abstract: An abstract domain for the Abstract Interpretation of logic programs is presented. This domain(More)
Abstract interpretation is a systematic methodology to design static program analysis which has been studied extensively in the logic programming community, because of the potential for optimizations in logic programming compilers and the sophistication of the analyses which require conceptual support. With the emergence of e cient generic abstract(More)