SPEED: Precise and efficient static estimation of program computational complexity

ACM SIGPLAN Notices

Volumn 44, Issue 1, 2009, Pages 127-139

  Gulwani, Sumit ^a   Mehra, Krishna K ^a   Chilimbi, Trishul ^a  

^a MICROSOFT RESEARCH   (United States)

Author keywords

Counter instrumentation; Quantitative functions; Symbolic complexity bounds; Termination analysis

Indexed keywords

ABSTRACT DATA; AUTOMATICALLY GENERATED; COMPLEXITY BOUNDS; CONSTANT FACTORS; COUNTER INSTRUMENTATION; EARLY DETECTION; GENERATION TOOLS; HEIGHT OF A TREE; IMPLEMENTATION COMPLEXITY; INPUT DATAS; INTER-PROCEDURAL; LIBRARY CODES; LINEAR BOUNDS; MICROSOFT; MULTIPLE PROGRAM; NON-LINEAR; NON-TRIVIAL; NUMERICAL PROPERTIES; PERFORMANCE PROBLEMS; PRODUCT CODE; QUANTITATIVE FUNCTIONS; REAL-WORLD; SCALAR INPUTS; STATIC ESTIMATION; SYMBOLIC COMPLEXITY BOUNDS; TERMINATION ANALYSIS; UNINTERPRETED FUNCTIONS;

COMPUTATIONAL EFFICIENCY; COMPUTER AIDED LANGUAGE TRANSLATION; INSTRUMENTS; INVENTORY CONTROL;

COMPUTATIONAL COMPLEXITY;

EID: 70350345580     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (30)

1. J. Berdine, A. Chawdhary, B. Cook, D. Distefano, and P. O'Hearn. Variance analyses from invariance analyses. In POPL, 2007.
2. D. Beyer, T. Henzinger, R. Majumdar, and A. Rybalchenko. Invariant synthesis for combined theories. In VMCAI'07, pages 378-394.
3. A. Bouajjani, M. Bozga, P. Habermehl, R. Iosif, P. Moro, and T. Vojnar. Programs with lists are counter automata. In CAV, 2006.
4. A. R. Bradley, Z. Manna, and H. B. Sipma. The polyranking principle. In ICALP, pages 1349-1361, 2005.
5. A. R. Bradley, Z. Manna, and H. B. Sipma. Termination analysis of integer linear loops. In CONCUR, pages 488-502, 2005.
6. B. Cook, A. Podelski, and A. Rybalchenko. Termination proofs for systems code. In PLDI, pages 415-426, 2006.
7. P. Cousot and N. Halbwachs. Automatic Discovery of Linear Restraints among Variables of a Program. In POPL, 1978.
8. K. Crary and S. Weirich. Resource bound certification. In POPL, pages 184-198, 2000.
9. N. A. Danielsson. Lightweight semiformal time complexity analysis for purely functional data structures. In POPL, pages 133-144, 2008.
10. N. Dor, M. Rodeh, and M. Sagiv. CSSV: towards a realistic tool for statically detecting all buffer overflows in C. In PLDI, 2003.
11. S. Goldsmith, A. Aiken, and D. S. Wilkerson. Measuring empirical computational complexity. In ESEC/SIGSOFT FSE, 2007.
12. B. S. Gulavani and S. Gulwani. A numerical abstract domain based on expression abstraction and max operator with application in timing analysis. In CAV, pages 370-384, 2008.
13. S. Gulwani, krishna Mehra, and T. Chilimbi. Speed: Precise and efficient static estimation of program computational complexity. Technical Report MSR-TR-2008-2095, Microsoft Research, 2008.
14. S. Gulwani, T. Lev-Ami, and M. Sagiv. A combination framework for tracking partition sizes. In POPL, 2009.
15. S. Gulwani and G. C. Necula. A Polynomial-Time Algorithm for Global Value Numbering. In SAS, pages 212-227, 2004.
16. S. Gulwani and A. Tiwari. Combining Abstract Interpreters. In PLDI, pages 376-386, 2006.
17. J. Gustafsson, A. Ermedahl, C. Sandberg, and B. Lisper. Automatic derivation of loop bounds and infeasible paths for wcet analysis using abstract execution. In RTSS, pages 57-66, 2006.
18. N. Halbwachs, Y.-E. Proy, and P. Roumanoff. Verification of real-time systems using linear relation analysis. FMSD, 11(2), '97.
19. C. A. Healy, M. Sjodin, V. Rustagi, D. B. Whalley, and R. van Engelen. Supporting timing analysis by automatic bounding of loop iterations. Real-Time Systems, 18(2/3):129-156, 2000.
20. M. Hofmann and S. Jost. Static prediction of heap space usage for first-order functional programs. In POPL, pages 185-197, 2003.
21. J. Hughes and L. Pareto. Recursion and Dynamic Data-structures in bounded space: Towards Embedded ML Programming. In ICFP, '99.
22. K. R. M. Leino and P. Müller. Object invariants in dynamic contexts. In ECOOP, volume 3086 of LNCS, pages 491-516, 2004.
23. S. Magill, J. Berdine, E. M. Clarke, and B. Cook. Arithmetic strengthening for shape analysis. In SAS, pages 419-436, 2007.
24. D. L. Métayer. Ace: An Automatic Complexity Evaluator. ACM Trans. Program. Lang. Syst., 10(2):248-266, 1988.
25. J. Navas, E. Mera, P. López-García, and M. V. Hermenegildo. Userdefinable resource bounds analysis for logic programs. In ICLP, pages 348-363, 2007.
26. Microsoft Phoenix Compiler Infrastructure, http://research.microsoft.com/ phoenix/.
27. A. Podelski and A. Rybalchenko. Transition invariants. In LICS, pages 32-41. IEEE, July 2004.
28. M. Rosendahl. Automatic Complexity Analysis. In FPCA, pages 144-156, New York, NY, USA, 1989. ACM Press.
29. R. Wilhelm, J. Engblom, A. Ermedahl, N. Holsti, S. Thesing, D. Whalley, G. Bernat, C. Ferdinand, R. Heckmann, F. Mueller, I. Puaut, P. Puschner, J. Staschulat, and P. Stenstrm. The Determination of Worst-Case Execution Times-Overview of the Methods and Survey of Tools. In ACM Transactions on Embedded Computing Systems (TECS), 2007.
30. R. Wilhelm and B. Wachter. Abstract interpretation with applications to timing validation. In CAV, pages 22-36, 2008.