Efficient dataflow analysis of logic programs

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Scopus citations

Abstract

We investigate a framework for efficient flow analyses of logic programs. A major problem in this context is that unification can give rise to aliasing and dependencies between variables whose effects are difficult to predict, and which make sound flow analysis algorithms computationally expensive. We give a simple characterization of the class of flow analysis problems for which aliasing effects can be ignored without loss of soundness, and describe an efficient analysis procedure for this class of problems. The utility of our approach is illustrated by discussing its application to several analysis and optimization problems for logic programs. Our results are useful in the design of efficient flow analysis systems for logic programming languages.

Original languageEnglish (US)
Title of host publicationProceedings of the 15th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1988
PublisherAssociation for Computing Machinery
Pages260-273
Number of pages14
VolumePart F130193
ISBN (Electronic)0897912527
DOIs
StatePublished - Jan 13 1988
Event15th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1988 - San Diego, United States
Duration: Jan 10 1988Jan 13 1988

Other

Other15th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1988
CountryUnited States
CitySan Diego
Period1/10/881/13/88

ASJC Scopus subject areas

  • Software

Fingerprint Dive into the research topics of 'Efficient dataflow analysis of logic programs'. Together they form a unique fingerprint.

Cite this