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

Traditional schemes for abstract interpretation-based global analysis of logic programs
generally focus on obtaining procedure-argument mode and type information. Variable …

This chapter presents an approach to the analysis of reactive programs, formalised in the
framework of Abstract lnterpretatioil. We model reactive programs by Kripke structures …

This paper describes an empirical comparison of four contextinsensitive pointer alias
analysis algorithms that use varying degrees of flow-sensitivity: a flow-insensitive algorithm …

Logic-programming languages are based on a principle of separation “logic” and “control.”.
This means that they can be given simple model-theoretic semantics without regard to any …

It is often useful to introduce probabilistic behavior in programs, either because of the use of
internal random generators (probabilistic algorithms), either because of some external …

We introduce a practical method for abductive analysis of modular logic programs. This is
obtained by reversing the deduction process, which is usually applied in static-data ow …

Increasingly, compilers for logic programs are making use of information from dataflow
analyses to aid in the generation of efficient target code. However, generating efficient target …

Abstract interpretation theory provides a semantic foundation for dataflow analysis of
programs by formalizing the relationship between analysis and semantics. In the original …

Program bugs remain a major challenge for software developers and various tools have
been proposed to help with their localization and elimination. Most present-day tools are …