Abstract
As imperative programs get larger and larger, many inter-procedural analyses produce progressively poorer results, even as the (usually) polynomial cost hurts more and more. The problem is not just program size, but that larger programs contain analysis defeating idioms (e.g., manual persistence methods and dispatch vectors) and deeper levels of procedural abstraction. In this talk, I will discuss what my group has learned about analyzing mega-programs (applications exceeding one million lines of non-blank, non-comment source lines). I will report on our approaches that have and haven’t worked, our attempts to get meaningful information from analyses with near-linear complexities, engineering issues that must be resolved when dealing with mega-programs, and our best guesses regarding the eventual feasibility of routinely performing static analysis on mega-programs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weise, D. (1999). Static Analysis of Mega-Programs. In: Cortesi, A., Filé, G. (eds) Static Analysis. SAS 1999. Lecture Notes in Computer Science, vol 1694. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48294-6_19
Download citation
DOI: https://doi.org/10.1007/3-540-48294-6_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66459-8
Online ISBN: 978-3-540-48294-9
eBook Packages: Springer Book Archive