On the Complexity Analysis of Static Analyses

  • David McAllester
Conference paper

DOI: 10.1007/3-540-48294-6_21

Part of the Lecture Notes in Computer Science book series (LNCS, volume 1694)
Cite this paper as:
McAllester D. (1999) On the Complexity Analysis of Static Analyses. In: Cortesi A., Filé G. (eds) Static Analysis. SAS 1999. Lecture Notes in Computer Science, vol 1694. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • David McAllester
    • 1
  1. 1.AT&T Labs-ResearchFlorham ParkUSA

Personalised recommendations