Name
Abstract | ||
|---|---|---|
This paper presents a new approach for automatically deriving worst-case resource bounds for C programs. The described technique combines ideas from amortized analysis and abstract interpretation in a unified framework to address four challenges for state-of-the-art techniques: compositionality, user interaction, generation of proof certificates, and scalability. Compositionality is achieved by incorporating the potential method of amortized analysis. It enables the derivation of global whole-program bounds with local derivation rules by naturally tracking size changes of variables in sequenced loops and function calls. The resource consumption of functions is described abstractly and a function call can be analyzed without access to the function body. User interaction is supported with a new mechanism that clearly separates qualitative and quantitative verification. A user can guide the analysis to derive complex non-linear bounds by using auxiliary variables and assertions. The assertions are separately proved using established qualitative techniques such as abstract interpretation or Hoare logic. Proof certificates are automatically generated from the local derivation rules. A soundness proof of the derivation system with respect to a formal cost semantics guarantees the validity of the certificates. Scalability is attained by an efficient reduction of bound inference to a linear optimization problem that can be solved by off-the-shelf LP solvers. The analysis framework is implemented in the publicly-available tool C4B. An experimental evaluation demonstrates the advantages of the new technique with a comparison of C4B with existing tools on challenging micro benchmarks and the analysis of more than 2900 lines of C code from the cBench benchmark suite. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1145/2737924.2737955 | PLDI |
Keywords | Field | DocType |
Amortized Analysis,LP Solving,Program Logic,Quantitative Verification,Resource Bound Analysis,Static Analysis | Principle of compositionality,Programming language,Subroutine,Abstract interpretation,Computer science,Static analysis,Amortized analysis,Hoare logic,Theoretical computer science,Differentiation rules,Soundness | Conference |
Volume | Issue | ISSN |
50 | 6 | 0362-1340 |
Citations | PageRank | References |
29 | 0.79 | 23 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Quentin Carbonneaux | 1 | 47 | 2.11 |
| Jan Hoffmannand | 2 | 203 | 16.61 |
| Zhong Shao | 3 | 897 | 68.80 |