Abstract Interpretation and Application to Logic Programs

  title={Abstract Interpretation and Application to Logic Programs},
  author={Patrick Cousot and Radhia Cousot},
  journal={J. Log. Program.},
Denotational abstract interpretation of logic programs
A denotational definition of the semantics of definite logic programs is presented, and one instance of the definition is exemplified by developing a provably correct groundness analysis to predict how variables may be bound to ground terms during execution.
Practical Model-Based Static Analysis for Definite Logic Programs
A core semantics parameterised by a pre-interpretation of the language underlying the program is defined, given by an extended Herbrand interpretation, capturing the correct answers of a program.
Semantics-based program analysis via symbolic composition of transfer relations
It is explained that the classical limitation of program analysis to build a property a single execution step at a time can result in dramatic loss of precision, but may be overcome by using $\oplus$ to compose multiple steps before applying a classical analysis.
An abstract interpretation framework for semantics and diagnosis of Lazy functional-logic languages
In program analysis, abstract interpretation theory is often used to establish the correctness of specific analysis algorithms and abstract domains, and this work is more concerned in its application to the systematic derivation of the (optimal) abstract semantics from the abstract domain.
Sequence-based Abstract Interpretation of Prolog 1
This paper proposes a novel framework for the abstract interpretation of Prolog which handles the depth-rst search rule and the cut operator and relies on the notion of substitution sequence to model the result of the execution of a goal.
Sequence-based abstract interpretation of Prolog
This paper proposes a novel framework for the abstract interpretation of Prolog which handles the depth-first search rule and the cut operator and relies on the notion of substitution sequence to model the result of the execution of a goal.
Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and PER analysis of functional languages)
  • P. CousotR. Cousot
  • Computer Science
    Proceedings of 1994 IEEE International Conference on Computer Languages (ICCL'94)
  • 1994
A set-theoretic abstract interpretation framework is formulated in a way which is independent of both the programming language and the method used to specify its semantics, starting from its standard denotational semantics.
Abstract interpretation: past, present and future
This talk will consist in an introduction to the basic notions of abstract interpretation and the induced methodology for the systematic development of sound abstract interpretation-based tools.
Abstract Interpretation Based Formal Methods and Future Challenges
The main point is that in order to reason or compute about a complex system, some information must be lost, that is the observation of executions must be either partial or at a high level of abstraction.
Type Analysis for CHIP
This paper proposes a tool to support reasoning about (partial) correctness of constraint logic programs. The tool infers a specification that approximates the semantics of a given program. The


A Practical Framework for the Abstract Interpretation of Logic Programs
Static Analysis of Logic Programs for Independent And-Parallelism
Compile-Time Derivation of Variable Dependency Using Abstract Interpretation
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints
A program denotes computations in some universe of objects. Abstract interpretation of programs consists in using that denotation to describe computations in another universe of abstract objects, so
Systematic design of program analysis frameworks
The systematic and correct design of program analysis frameworks with respect to a formal semantics is devoted to the main elements of the lattice theoretic approach to approximate semantic analysis of programs.
Bottom-Up Dataflow Analysis of Normal Logic Programs
A Type System for Logic Programs
A Language Independent Proof of the Soundness and Completeness of Generalized Hoare Logic
Collecting interpretations of expressions
It is argued that the method is simple (in particular, no powerdomains are needed), yet more expressive than existing methods (it is the first exact collecting interpretation for either nonstrict higher order languages).
Automatic complexity analysis of logic problems
This dissertation describes the design and implementation of a (semi)-automatic worst-case complexity analysis system for logic programs, and presents several source-level program transformation techniques for optimizing the evaluation of logic programs containing finite-domain constraints.