A general framework for semantics-based bottom-up abstract interpretation of logic programs
- 1 January 1993
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 15 (1) , 133-181
- https://doi.org/10.1145/151646.151650
Abstract
The theory of abstract interpretation provides a formal framework to develop advanced dataflow analysis tools. The idea is to define a nonstandard semantics which is able to compute, in finite time, an approximated model of the program. In this paper, we define an abstract interpretation framework based on a fixpoint approach to the semantics. This leads to the definition, by means of a suitable set of operators, of an abstract fixpoint characterization of a model associated with the program. Thus, we obtain a specializable abstract framework for bottom-up abstract interpretations of definite logic programs. The specialization of the framework is shown on two examples, namely, gound-dependence analysis and depth-kanalysis.Keywords
This publication has 19 references indexed in Scilit:
- Declarative modeling of the operational behavior of logic languagesTheoretical Computer Science, 1989
- Automatic mode inference for logic programsThe Journal of Logic Programming, 1988
- A kripke-kleene semantics for logic programs*The Journal of Logic Programming, 1985
- Some global optimizations for a PROLOG compilerThe Journal of Logic Programming, 1985
- Properties of substitutions and unificationsJournal of Symbolic Computation, 1985
- Enumeration of success patterns in logic programsTheoretical Computer Science, 1984
- A polymorphic type system for prologArtificial Intelligence, 1984
- A structured approach to static semantics correctnessScience of Computer Programming, 1983
- The Semantics of Predicate Logic as a Programming LanguageJournal of the ACM, 1976
- Galois connexionsTransactions of the American Mathematical Society, 1944