Abstract interpretation is a theory of semantics approximation that is used for the
construction of semantic-based program analysis algorithms (sometimes called “data flow …

A constraint can be thought of intuitively as a restriction on a space of possibilities.
Mathematical constraints are precisely specifiable relations among several unknowns (or …

The advent of ever more complex reactive systems in increasingly critical areas calls for the
development of automated verification techniques. Model checking is one such technique …

Completeness is an ideal, although uncommon, feature of abstract interpretations,
formalizing the intuition that, relatively to the properties encoded by the underlying abstract …

In order to contribute to the solution of the software reliability problem, tools have been
designed to analyze statically the run-time behavior of programs. Because the correctness …

This paper presents a collection of techniques, a methodology, in which abstract
interpretation, flow analysis, and model checking are employed in the representation …

We show that non-determinism simplifies coding certain problems into programs. We define
a non-confluent, but well-behaved class of rewrite systems for supporting non-deterministic …

We present simple and powerful generalized algebraic semantics for constraint logic
programs that are parameterized with respect to the underlying constraint system. The idea …

Many static analyses for declarative programming/database languages use Boolean
functions to express dependencies among variables or argument positions. Examples …

This paper illustrates the role of a class of “prop”-ositional logic programs in the analysis of
complex properties of logic programs. Analyses are performed by abstracting Prolog …