|
1 | 1 | \includepdf[pages={1-},addtotoc={ |
2 | | - 2,subsection,2,{Introduction: letting ICC drive the development of static analyzers},sec:fscd-intro, |
3 | | - 3,subsection,2,{Background: the original flow analysis},sec:fscd-background, |
4 | | - 3,subsubsection,3,{Language analyzed: fragments of imperative language},sssec:fscd-lang, |
5 | | - 3,subsubsection,3,{A flow calculus of mwp-bounds for complexity analysis},sssec:fscd-calc, |
6 | | - 5,subsubsection,3,{Limitations and inefficiencies of the mwp analysis},sssec:fscd-limits, |
7 | | - 6,subsection,2,{A deterministic, always-terminating, declension of the mwp analysis},sec:fscd-det, |
8 | | - 7,subsubsection,3,{Internalizing non-determinism: the choice data flow semi-rings},sssec:fscd-rings, |
9 | | - 7,subsubsection,3,{Internalizing failure: de-correlating derivations and bounds},sssec:fscd-fail, |
10 | | - 8,subsubsection,3,{Merging the improvements: illustrations and proofs},sssec:fscd-merging, |
11 | | - 10,subsection,2,{Extending and improving the analysis: functions and efficiency},sec:fscd-extending, |
12 | | - 10,subsubsection,3,{Leveraging compositionality to analyze function calls},sssec:fscd-comp, |
13 | | - 12,subsubsection,3,{Integrating recursive calls, the easy way},sssec:fscd-recs, |
14 | | - 13,subsubsection,3,{Taking advantage of polynomial structure to compute efficiently},sssec:fscd-poly, |
15 | | - 14,subsubsection,3,{Deciding the existence of a bound faster thanks to delta graphs},sssec:fscd-dg, |
16 | | - 15,subsection,2,{Implementing, testing and comparing the analysis},sec:fscd-eval, |
17 | | - 15,subsubsection,3,{Experimental evaluation},sssec:fscd-eval, |
18 | | - 15,subsubsection,3,{Related tools and incompatible metrics},sssec:fscd-metrics, |
19 | | - 16,subsection,2,{Conclusion: limitations, strengths and future work},sec:fscd-conc, |
20 | | - 20,subsection,2,{Appendix A: Technical appendix on semi-rings (abridged)},sec:fscd-app-a, |
| 2 | + 2,subsection,2,{Introduction: Letting ICC Drive the Development of Static Analyzers},sec:fscd-intro, |
| 3 | + 3,subsection,2,{Background: The Original Flow Analysis},sec:fscd-background, |
| 4 | + 3,subsubsection,3,{Language Analyzed: Fragments of Imperative Language},sssec:fscd-lang, |
| 5 | + 3,subsubsection,3,{A Flow Calculus of mwp-Bounds for Complexity Analysis},sssec:fscd-calc, |
| 6 | + 5,subsubsection,3,{Limitations and Inefficiencies of the mwp Analysis},sssec:fscd-limits, |
| 7 | + 6,subsection,2,{A Deterministic, Always-Terminating, Declension of the mwp Analysis},sec:fscd-det, |
| 8 | + 7,subsubsection,3,{Internalizing Non-determinism: The Choice Data Flow Semi-rings},sssec:fscd-rings, |
| 9 | + 7,subsubsection,3,{Internalizing Failure: De-correlating Derivations and Bounds},sssec:fscd-fail, |
| 10 | + 8,subsubsection,3,{Merging the Improvements: Illustrations and Proofs},sssec:fscd-merging, |
| 11 | + 10,subsection,2,{Extending and Improving the Analysis: Functions and Efficiency},sec:fscd-extending, |
| 12 | + 10,subsubsection,3,{Leveraging Compositionality to Analyze Function Calls},sssec:fscd-comp, |
| 13 | + 12,subsubsection,3,{Integrating Recursive Calls, the Easy Way},sssec:fscd-recs, |
| 14 | + 13,subsubsection,3,{Taking Advantage of Polynomial Structure to Compute Efficiently},sssec:fscd-poly, |
| 15 | + 14,subsubsection,3,{Deciding the Existence of a Bound Faster Thanks to Delta Graphs},sssec:fscd-dg, |
| 16 | + 15,subsection,2,{Implementing, Testing and Comparing the Analysis},sec:fscd-eval, |
| 17 | + 15,subsubsection,3,{Experimental Evaluation},sssec:fscd-eval, |
| 18 | + 15,subsubsection,3,{Related Tools and Incompatible Metrics},sssec:fscd-metrics, |
| 19 | + 16,subsection,2,{Conclusion: Limitations, Strengths and Future Work},sec:fscd-conc, |
| 20 | + 20,subsection,2,{Appendix A: Technical Appendix on Semi-rings (Abridged)},sec:fscd-app-a, |
21 | 21 | 21,subsection,2,{Appendix B: Omitted Proofs},sec:fscd-app-b, |
22 | 22 | 22,subsection,2,{Appendix C: Benchmarks},sec:fscd-app-c, |
23 | | - 22,subsubsection,3,{Descriptions of program groups},sssec:fscd-groups, |
| 23 | + 22,subsubsection,3,{Descriptions of Program Groups},sssec:fscd-groups, |
24 | 24 | 22,subsubsection,3,{Results},sssec:fscd-results, |
25 | 25 | 22,subsubsection,3,{Comparison},sssec:fscd-comparison |
26 | 26 | }, addtolist={ |
|
0 commit comments