The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
SPEED: precise and efficient static estimation of program computational complexity
Abstract
This paper describes an inter-procedural technique for computing symbolic bounds on the number of statements a procedure executes in terms of its scalar inputs and user-defined quantitative functions of input data-structures. Such computational complexity bounds for even simple programs are usually disjunctive, non-linear, and involve numerical properties of heaps. We address the challenges of generating these bounds using two novel ideas.We introduce a proof methodology based on multiple counter instrumentation (each counter can be initialized and incremented at potentially multiple program locations) that allows a given linear invariant generation tool to compute linear bounds individually on these counter variables. The bounds on these counters are then composed together to generate total bounds that are non-linear and disjunctive. We also give an algorithm for automating this proof methodology. Our algorithm generates complexity bounds that are usually precise not only in terms of the computational complexity, but also in terms of the constant factors.Next, we introduce the notion of user-defined quantitative functions that can be associated with abstract data-structures, e.g., length of a list, height of a tree, etc. We show how to compute bounds in terms of these quantitative functions using a linear invariant generation tool that has support for handling uninterpreted functions. We show application of this methodology to commonly used data-structures (namely lists, list of lists, trees, bit-vectors) using examples from Microsoft product code. We observe that a few quantitative functions for each data-structure are usually sufficient to allow generation of symbolic complexity bounds of a variety of loops that iterate over these data-structures, and that it is straightforward to define these quantitative functions.The combination of these techniques enables generation of precise computational complexity bounds for real-world examples (drawn from Microsoft product code and C++ STL library code) for some of which it is non-trivial to even prove termination. Such automatically generated bounds are very useful for early detection of egregious performance problems in large modular codebases that are constantly being changed by multiple developers who make heavy use of code written by others without a good understanding of their implementation complexity.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
The worst-case execution-time problem—overview of methods and survey of tools
Wilhelm, R., Engblom, J., Ermedahl, A., Holsti, N., Thesing, S., Whalley, D., Bernat, G., Ferdinand, C., Heckmann, R., Mitra, T., et al. (2008) · ACM Transactions on Embedded Computing Systems · doi:10.1145/1347375.1347389 · Cited by 1,871
Automatic discovery of linear restraints among variables of a program
Cousot, P., & Halbwachs, N. (1978) · Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '78 · doi:10.1145/512760.512770 · Cited by 1,614
Termination proofs for systems code
Cook, B., Podelski, A., & Rybalchenko, A. (2006) · ACM SIGPLAN Notices · doi:10.1145/1133255.1134029 · Cited by 317
Static prediction of heap space usage for first-order functional programs
Hofmann, M., & Jost, S. (2003) · Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/604131.604148 · Cited by 294
Verification of Real-Time Systems using Linear Relation Analysis
Halbwachs, N., Proy, Y. E., & Roumanoff, P. (1997) · Formal Methods in System Design · doi:10.1023/a:1008678014487 · Cited by 262
Termination proofs for systems code
Cook, B., Podelski, A., & Rybalchenko, A. (2006) · Proceedings of the 27th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1133981.1134029 · Cited by 240
Crary, K., & Weirich, S. (2000) · Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages · doi:10.1145/325694.325716 · Cited by 218
Automatic Derivation of Loop Bounds and Infeasible Paths for WCET Analysis Using Abstract Execution
Gustafsson, J., Ermedahl, A., Sandberg, C., & Lisper, B. (2006) · 2006 27th IEEE International Real-Time Systems Symposium (RTSS'06) · doi:10.1109/rtss.2006.12 · Cited by 191
Rosendahl, M. (1989) · International Conference on Functional Programming Languages and Computer Architecture (FPCA) · doi:10.1145/99370.99381 · Cited by 189
Measuring empirical computational complexity
Goldsmith, S. F., Aiken, A., & Wilkerson, D. S. (2007) · ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE) · doi:10.1145/1287624.1287681 · Cited by 158
Cited by
Multi-resource packing for cluster schedulers
Grandl, R., Ananthanarayanan, G., Kandula, S., Rao, S., & Akella, A. (2014) · Proceedings of the 2014 ACM conference on SIGCOMM · doi:10.1145/2619239.2626334 · Cited by 421
Understanding and detecting real-world performance bugs
Jin, G., Song, L., Shi, X., Scherpelz, J., & Lu, S. (2012) · Proceedings of the 33rd ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/2254064.2254075 · Cited by 304
Metadata
- Authors
- Gulwani, S., Mehra, K. K., & Chilimbi, T.
- Venue
- Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
- Publisher
- ACM
- Published
- 2009-01-21
- Pages
- 127-139
- OpenAlex
- W2109863363
- Cited by
- 266
- References
- 22
- FWCI
- 22.56
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: SPEED: precise and efficient static estimation of program computational complexity. https://app.cochat.ai/papers/10.1145/1480881.1480898
- The paper
- Gulwani, S., Mehra, K. K., & Chilimbi, T. (2009). SPEED: precise and efficient static estimation of program computational complexity. Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages. https://doi.org/10.1145/1480881.1480898
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.