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 | |
| 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 |
Fingerprint
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science(all)
Cite this
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
}
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
ER -