On the complexity of dataflow analysis of logic programs

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

It is widely held that there is a correlation between complexity and precision in dataflow analysis, in the sense that the more precise an analysis algorithm, the more computationally expensive it must be. The details of this relationship, however, appear to not have been explored extensively. This article reports some results on this correlation in the context of logic programs. A formal notion of the 'precision' of an analysis algorithm is proposed, and this is used to characterize the worst-case computational complexity of a number of dataflow analyses with different degrees of precision. While this article considers the analysis of logic programs, the technique proposed, namely the use of 'exactness sets' to study relationships between complexity and precision of analyses, is not specific to logic programming in any way, and is equally applicable to flow analyses of other language families.

Original languageEnglish (US)
Pages (from-to)331-365
Number of pages35
JournalACM Transactions on Programming Languages and Systems
Volume17
Issue number2
DOIs
StatePublished - Mar 1995

Fingerprint

Data flow analysis
Logic programming
Computational complexity

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software

Cite this

On the complexity of dataflow analysis of logic programs. / Debray, Saumya K.

In: ACM Transactions on Programming Languages and Systems, Vol. 17, No. 2, 03.1995, p. 331-365.

Research output: Contribution to journalArticle

@article{3b01753c4255406c83f6e870ffe116a8,
title = "On the complexity of dataflow analysis of logic programs",
abstract = "It is widely held that there is a correlation between complexity and precision in dataflow analysis, in the sense that the more precise an analysis algorithm, the more computationally expensive it must be. The details of this relationship, however, appear to not have been explored extensively. This article reports some results on this correlation in the context of logic programs. A formal notion of the 'precision' of an analysis algorithm is proposed, and this is used to characterize the worst-case computational complexity of a number of dataflow analyses with different degrees of precision. While this article considers the analysis of logic programs, the technique proposed, namely the use of 'exactness sets' to study relationships between complexity and precision of analyses, is not specific to logic programming in any way, and is equally applicable to flow analyses of other language families.",
author = "Debray, {Saumya K}",
year = "1995",
month = "3",
doi = "10.1145/201059.201068",
language = "English (US)",
volume = "17",
pages = "331--365",
journal = "ACM Transactions on Programming Languages and Systems",
issn = "0164-0925",
publisher = "Association for Computing Machinery (ACM)",
number = "2",

}

TY - JOUR

T1 - On the complexity of dataflow analysis of logic programs

AU - Debray, Saumya K

PY - 1995/3

Y1 - 1995/3

N2 - It is widely held that there is a correlation between complexity and precision in dataflow analysis, in the sense that the more precise an analysis algorithm, the more computationally expensive it must be. The details of this relationship, however, appear to not have been explored extensively. This article reports some results on this correlation in the context of logic programs. A formal notion of the 'precision' of an analysis algorithm is proposed, and this is used to characterize the worst-case computational complexity of a number of dataflow analyses with different degrees of precision. While this article considers the analysis of logic programs, the technique proposed, namely the use of 'exactness sets' to study relationships between complexity and precision of analyses, is not specific to logic programming in any way, and is equally applicable to flow analyses of other language families.

AB - It is widely held that there is a correlation between complexity and precision in dataflow analysis, in the sense that the more precise an analysis algorithm, the more computationally expensive it must be. The details of this relationship, however, appear to not have been explored extensively. This article reports some results on this correlation in the context of logic programs. A formal notion of the 'precision' of an analysis algorithm is proposed, and this is used to characterize the worst-case computational complexity of a number of dataflow analyses with different degrees of precision. While this article considers the analysis of logic programs, the technique proposed, namely the use of 'exactness sets' to study relationships between complexity and precision of analyses, is not specific to logic programming in any way, and is equally applicable to flow analyses of other language families.

UR - http://www.scopus.com/inward/record.url?scp=0029273133&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029273133&partnerID=8YFLogxK

U2 - 10.1145/201059.201068

DO - 10.1145/201059.201068

M3 - Article

AN - SCOPUS:0029273133

VL - 17

SP - 331

EP - 365

JO - ACM Transactions on Programming Languages and Systems

JF - ACM Transactions on Programming Languages and Systems

SN - 0164-0925

IS - 2

ER -