On the complexity of dataflow analysis of logic programs

Saumya K Debray

doi:10.1007/3-540-55719-9_100

On the complexity of dataflow analysis of logic programs

Saumya K Debray

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Scopus citations

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 correspondence, however, appear to not have been explored extensively. This paper reports some results on this tra~leotf in the context of Horn logic prograxns. 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 analysis algorithms with different degrees of precision.

Original language	English (US)
Title of host publication	Automata, Languages and Programming - 19th International Colloquium, Proceedings
Publisher	Springer Verlag
Pages	509-520
Number of pages	12
Volume	623 LNCS
ISBN (Print)	9783540557197
DOIs	https://doi.org/10.1007/3-540-55719-9_100
State	Published - 1992
Event	19th International Colloquium on Automata, Languages, and Programming, ICALP 1992 - Wien, Austria Duration: Jul 13 1992 → Jul 17 1992

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	623 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	19th International Colloquium on Automata, Languages, and Programming, ICALP 1992
Country	Austria
City	Wien
Period	7/13/92 → 7/17/92

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1007/3-540-55719-9_100

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

Cite this

Debray, S. K. (1992). On the complexity of dataflow analysis of logic programs. In Automata, Languages and Programming - 19th International Colloquium, Proceedings (Vol. 623 LNCS, pp. 509-520). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 623 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-55719-9_100

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

Automata, Languages and Programming - 19th International Colloquium, Proceedings. Vol. 623 LNCS Springer Verlag, 1992. p. 509-520 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 623 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Debray, SK 1992, On the complexity of dataflow analysis of logic programs. in Automata, Languages and Programming - 19th International Colloquium, Proceedings. vol. 623 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 623 LNCS, Springer Verlag, pp. 509-520, 19th International Colloquium on Automata, Languages, and Programming, ICALP 1992, Wien, Austria, 7/13/92. https://doi.org/10.1007/3-540-55719-9_100

Debray SK. On the complexity of dataflow analysis of logic programs. In Automata, Languages and Programming - 19th International Colloquium, Proceedings. Vol. 623 LNCS. Springer Verlag. 1992. p. 509-520. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/3-540-55719-9_100

@inproceedings{5c08175ebeb6491a90fe07d2830a95a4,

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 correspondence, however, appear to not have been explored extensively. This paper reports some results on this tra~leotf in the context of Horn logic prograxns. 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 analysis algorithms with different degrees of precision.",

author = "Debray, {Saumya K}",

year = "1992",

doi = "10.1007/3-540-55719-9_100",

language = "English (US)",

isbn = "9783540557197",

volume = "623 LNCS",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "509--520",

booktitle = "Automata, Languages and Programming - 19th International Colloquium, Proceedings",

address = "Germany",

note = "19th International Colloquium on Automata, Languages, and Programming, ICALP 1992 ; Conference date: 13-07-1992 Through 17-07-1992",

}

TY - GEN

T1 - On the complexity of dataflow analysis of logic programs

AU - Debray, Saumya K

PY - 1992

Y1 - 1992

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 correspondence, however, appear to not have been explored extensively. This paper reports some results on this tra~leotf in the context of Horn logic prograxns. 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 analysis algorithms with different degrees of precision.

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 correspondence, however, appear to not have been explored extensively. This paper reports some results on this tra~leotf in the context of Horn logic prograxns. 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 analysis algorithms with different degrees of precision.

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

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

U2 - 10.1007/3-540-55719-9_100

DO - 10.1007/3-540-55719-9_100

M3 - Conference contribution

AN - SCOPUS:85029782650

SN - 9783540557197

VL - 623 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 509

EP - 520

BT - Automata, Languages and Programming - 19th International Colloquium, Proceedings

PB - Springer Verlag

T2 - 19th International Colloquium on Automata, Languages, and Programming, ICALP 1992

Y2 - 13 July 1992 through 17 July 1992

ER -