Abstract
This paper introduces a logic for a class of properties — in particular variable aliasing — used in static analysis of logic programs. The logic is shown to be sound, complete and decidable. Moreover, it is illustrated how this logic can be applied to automatize some parts of the reasoning when proving the partial correctness of a logic program.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
S. Abramsky and C. Hankin. An Introduction to Abstract Interpretation. In Abstract Interpretation of declarative languages, pp. 9–31, eds. S. Abramsky and C. Hankin, Ellis Horwood, 1987.
K.R. Apt and E. Marchiori. Reasoning about Prolog programs: from Modes through Types to Assertions. Formal Aspects of Computing, 1994. In print.
L. Colussi and E. Marchiori. Proving Correctness of Logic Programs Using Axiomatic Semantics. Proceedings of the Eight International Conference, on Logic Programming, pp. 629–644, 1991.
L. Colussi and E. Marchiori. Unification as Predicate Transformer. Preliminary version in Proceedings JICSLP' 92, 67–85, 1992. Revised version submitted.
L. Colussi, E. Marchiori and M. Marchiori. Combining, Logic and Control to Characterize Global Invariants for Prolog Programs. CWI Report, The Netherlands, 1994.
P. Cousot and R. Cousot. Abstract Interpretation: a Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints. Proceedings of the 4th ACM Symposium on Principles of Programming Languages, pp. 238–251, 1977.
P. Cousot and R. Cousot. Systematic Design of Program Analysis Frameworks. Proceedings of the 6th ACM Symposium on Principles of Programming Languages, pp. 269–282, 1979.
P. Cousot and R. Cousot. Abstract Interpretation and Application to Logic Programs. Report LIX/RR/92/08, 1992. To appear in the special issue on Abstract Interpretation of the Journal of Logic Programming.
A. Cortesi, G. Filé and W. Winsborough. Prop Revisited: Propositional Formula as Abstract Domain. Proceedings of the Sixth Annual IEEE Symposium on Logic in Computer Science, pp. 322–327, 1991.
W. Drabent and J. Maluszynski. Inductive Assertion Method for Logic Programs. Theoretical Computer Science 59:1, pp. 133–155, 1988.
D. Jacobs and A. Langen. Accurate and Efficient Approximation of Variable Aliasing in Logic Programs. Proceedings of the North American Conference on Logic Programming, pp. 155–165, 1989.
K. Marriott and H. Søndergaard. Notes for a Tutorial on Abstract Interpretation of Logic Programs. North American Conference on Logic Programming, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag
About this paper
Cite this paper
Marchiori, E. (1994). A logic for variable aliasing in logic programs. In: Levi, G., Rodríguez-Artalejo, M. (eds) Algebraic and Logic Programming. ALP 1994. Lecture Notes in Computer Science, vol 850. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58431-5_20
Download citation
DOI: https://doi.org/10.1007/3-540-58431-5_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58431-5
Online ISBN: 978-3-540-48791-3
eBook Packages: Springer Book Archive