On the Complexity Analysis of Static Analyses
This paper investigates bottom-up logic programming as a formalism for expressing static analyses. The main technical contribution consists of two meta-complexity theorems which allow, in many cases, the asymptotic running time of a bottom-up logic program to be determined by inspection. It is well known that a datalog program runs in O(nk) time where k is the largest number of free variables in any single rule. The theorems given here are significantly more refined. A variety of algorithms given as bottom-up logic programs are analyzed as examples.
Unable to display preview. Download preview PDF.
- 1.A. Aiken, E. Wimmers, and T.K. Lakshman. Soft typing with conditional types. In ACM Symposium on Principles of Programming Languages, pages 163–173. Association for Computing Machinery, 1994.Google Scholar
- 2.David Basin and Herald Ganzinger. Automated complexity analysis based on ordered resolution. In Proceedings, Eleventh Annual IEEE Symposium on Logic in Computer Science, pages 456–465. IEEE Computer Society Press, 1996.Google Scholar
- 3.A. Bondorf and A. Jorgensen. Efficient analysis for realistic off-line partial evaluation. Journal of functional Programming, 3(3), 1993.Google Scholar
- 4.Keith L. Clark. Logic programming schemes and their implementations. In Jean-Louis Lassez and Gordon Plotkin, editors, Computational Logic. MIT Press, 1991.Google Scholar
- 6.Manual Fähndrich, Jeffery Foster, Zhendong Su, and Alexander Aiken. Partial online cycle elimination in inclusion constraint graphs. In PLDI98, 1998.Google Scholar
- 7.Robert Givan and David McAllester. New results on local inference relations. In Principles of Knowlwedge Representation and Reasoning: Proceedings of the Third International Conference, pages 403–412. Morgan Kaufman Press, October 1992. internet file ftp://ftp.ai.mit.edu:/pub/users/dam/kr92.ps.
- 8.N. Heintze. Set based analysis of ml programs. In ACM Conference on Lisp and Functional Programming, pages 306–317, 1994.Google Scholar
- 9.Nevin Heintze and David McAllester. Linear time subtransitive control flow analysis. In PLDI-97, 1997.Google Scholar
- 10.Nevin Heintze and David McAllester. On the cubic bottleneck in subtyping and flow analysis. In Proceedings, Twelvth Annual IEEE Symposium on Logic in Computer Science, pages 342–361. IEEE Computer Society Press, 1997.Google Scholar
- 12.R. A. Kowalski. Predicate logic as a programming language. In IFIP 74, 1974.Google Scholar
- 15.David McAllester. Inferring recursive types. Available at http://www.research.mit.edu/~dmac, 1996.
- 16.E. Melski and T. Reps. Intercovertability of set constraints and context free language reachability. In PEPM’97, 1997.Google Scholar
- 17.Jeff Naughton and Raghu Ramakrishnan. Bottom-up evaluation of logic programs. In Jean-Louis Lassez and Gordon Plotkin, editors, Computational Logic. MIT Press, 1991.Google Scholar
- 19.J. Palsberg and P. O’Keefe. A type system equivalent to flow analysis. In POPL95, pages 367–378, 1995.Google Scholar
- 21.J. Ullman. Bottom-up beats top-down for datalog. In Proceedings of the Eigth ACM SIGACT-SIGMOD-SIGART Symposium on the Principles of Database Systems, pages 140–149, March 1989.Google Scholar
- 22.M. Vardi. Complexity of relational query languages. In 14th Symposium on Theory of Computation, pages 137–146, 1982.Google Scholar