Static Analysis

Volume 1694 of the series Lecture Notes in Computer Science pp 312-329


On the Complexity Analysis of Static Analyses

  • David McAllesterAffiliated withAT&T Labs-Research

* Final gross prices may vary according to local VAT.

Get Access


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(n k) 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.