论文信息 - Systematic Semantic Approximations of Logic Programs

Systematic Semantic Approximations of Logic Programs

The notion of abstract interpretation facilitates a formal framework for approximating meanings of programs. This paper presents a new scheme for inferring run-time properties of logic programs. The work consists of three major parts: The first part provides a new semantic description of definite programs which extracts from all possible computations all reachable internal states of an abstract machine based on SLD-resolution. Since this meaning is not effectively computable we also provide a systematic method for approximating this meaning. Finally we provide an algorithm to effectively compute the approximate meanings of definite programs using a fair chaotic iteration strategy.

Ulf Nilsson | U. Nilsson

[1] Kim Marriott,et al. Bottom-up Abstract Interpretation of Logic Programs , 1988, ICLP/SLP.

[2] William H. Winsborough,et al. Path-Dependent Reachability Analysis for Multiple Specialization , 1989, NACLP.

[3] Ulf Nilsson,et al. Logic, programming and Prolog , 1990 .

[4] Ulf Nilsson,et al. Towards a Framework for the Abstract Interpretation of Logic Programs , 1988, PLILP.

[5] Maurice Bruynooghe,et al. A Practical Framework for the Abstract Interpretation of Logic Programs , 1991, J. Log. Program..

[6] John Wylie Lloyd,et al. Foundations of Logic Programming , 1987, Symbolic Computation.

[7] A. Tarski. A LATTICE-THEORETICAL FIXPOINT THEOREM AND ITS APPLICATIONS , 1955 .

[8] Chris Mellish,et al. Abstract Interpretation of Prolog Programs , 1986, ICLP.

[9] Patrick Cousot,et al. Systematic design of program analysis frameworks , 1979, POPL.

[10] Saumya K. Debray,et al. Automatic Mode Inference for Logic Programs , 1988, J. Log. Program..

[11] Patrick Cousot,et al. Automatic synthesis of optimal invariant assertions: Mathematical foundations , 1977 .

[12] Ulf Nilsson. A systematic approach to abstract interpretation of logic programs , 1989 .

[13] Patrick Cousot,et al. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.