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 language||English (US)|
|Number of pages||35|
|Journal||ACM Transactions on Programming Languages and Systems|
|Publication status||Published - Mar 1995|
ASJC Scopus subject areas
- Computer Graphics and Computer-Aided Design