Abstract
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.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
M. Bruynooghe. A Practical Framework for the Abstract Interpretation of Logic Programs. To appear in J. Logic Programming, 1990.
P. Cousot and R. Cousot. Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs By Construction or Approximation of Fixpoints. In Conf. Record of Fourth ACM Symposium on POPL, pages 238–252, Los Angeles, 1977.
P. Cousot and R. Cousot. Automatic Synthesis of Optimal Invariant Assertions: Mathematical Foundations. SIGPLAN Notices, 12(8):1–12, 1977.
P. Cousot and R. Cousot. Systematic Design of Program Analysis Frameworks. In Conf. Record of 6th ACM Symposium on POPL, pages 269–282, San Antonio, Texas, 1979.
S. Debray and D.S. Warren. Automatic Mode Inference for Logic Programs. J. of Logic Programming, 5(3):207–230, 1988.
N.D. Jones and H. Søndergaard. A Semantics-Based Framework for the Abstract Interpretation of Prolog. In S. Abramsky and C. Hankin, editors, Abstract Interpretation of Declarative Languages, pages 123–142. Ellis Horwood, 1987.
T. Kanamori and T. Kawamura. Analyzing Success Patterns of Logic Programs by Abstract Hybrid Interpretation. Technical Report TR-279, ICOT, 1987.
J.W. Lloyd. Foundations of Logic Programming. Springer-Verlag, second edition, 1987.
C. Mellish. Abstract Interpretation of Prolog Programs. In S. Abramsky and C. Hankin, editors, Abstract Interpretation of Declarative Languages, pages 181–198. Ellis Horwood, 1987.
K. Marriott and H. Søndergaard. Bottom-up Abstract Interpretation of Logic Programs. In Proc. of Fifth International Conf/Symposium on Logic Programming, Seattle, pages 733–748. MIT Press, 1988.
K. Marriott and H. Søndergaard. Bottom-up Dataflow Analysis of Normal Logic Programs. Research Report RC 14858, IBM T. J. Watson Research Center, Yorktown Heights, New York, 1989.
U. Nilsson. A Systematic Approach to Abstract Interpretation of Logic Programs. Licentiate Thesis 196, Department of Computer and Information Science, Linköping University, 1989.
U. Nilsson. Towards a Framework for the Abstract Interpretation of Logic Programs. In Proc. of PLILP '88, Orleans, France, pages 68–82. LNCS 348, Springer-Verlag, 1989.
U. Nilsson and J. Małuszyński. Logic, Programming and Prolog. John Wiley & Sons, 1990.
A. Tarski. A Lattice Theoretical Fixpoint Theorem and Its Applications. Pacific J. Math, 5:285–309, 1955.
W. Winsborough. Path-Dependent Reachability Analysis for Multiple Specialization. In Proc. of North American Conference on Logic Programming, Cleveland, pages 133–153. MIT Press, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nilsson, U. (1990). Systematic semantic approximations of logic programs. In: Deransart, P., Maluszyński, J. (eds) Programming Language Implementation and Logic Programming. PLILP 1990. Lecture Notes in Computer Science, vol 456. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024191
Download citation
DOI: https://doi.org/10.1007/BFb0024191
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53010-7
Online ISBN: 978-3-540-46298-9
eBook Packages: Springer Book Archive