A fast and precise static loop analysis based on abstract interpretation, program slicing and polytope models

Proceedings of the 2009 CGO - 7th International Symposium on Code Generation and Optimization

Volumn , Issue , 2009, Pages 136-146

  Lokuciejewski, Paul ^a   Cordes, Daniel ^a   Falk, Heiko ^a   Marwedel, Peter ^a  

^a Embedded System Software Group   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT INTERPRETATIONS; ANALYSIS TIME; CODE EXECUTION; FEEDBACK DIRECTED OPTIMIZATIONS; LOOP ANALYSIS; LOOP ITERATION; LOOP OPTIMIZATIONS; LOOP UNROLLING; POLYTOPE; PREPROCESS; PROGRAM ANALYSIS; PROGRAM SEMANTICS; PROGRAM SLICING; REAL-WORLD PROBLEM; STATIC INFORMATION; WORST-CASE EXECUTION TIME ANALYSIS;

ABSTRACTING; NETWORK COMPONENTS; PROGRAM COMPILERS; PROGRAM INTERPRETERS;

STRUCTURED PROGRAMMING;

EID: 67650563022     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CGO.2009.17     Document Type: Conference Paper

References (38)

1. S. S. Muchnick, Advanced compiler design and implementation. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc., 1997.
2. D. F. Bacon, S. L. Graham, and O. J. Sharp, "Compiler Transformations for High-performance Computing," ACM Comput. Surv., vol.26, no.4, pp. 345-420, 1994.
3. M. D. Smith, "Overcoming the Challenges to Feedback- Directed Optimization," in Proc. of DYNAMO, January 2000.
4. P. Berube and J. N. Amaral, "Aestimo: A Feedback-Directed Optimization Evaluation Tool," in Proc. of ISPASS, March 2006.
5. J. Gustafsson, A. Ermedahl, C. Sandberg, and B. Lisper, "Automatic Derivation of Loop Bounds and Infeasible Paths for WCET Analysis using Abstract Execution," in Proc. of RTSS, Dec. 2006.
6. P. Cousot and R. Cousot, "Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints," in POPL, January 1977.
7. M. S. C. Heal and D. Whalley, "Bounding Loop Iterations for Timing Analysis," in Proc. of RTAS, June 1998.
8. M. Kirner, "Automatic Loop Bound Analysis of Programs Written in C," Master's thesis, Technische Universität Wien, 2006.
9. C. Cullmann and F. Martin, "Data-Flow Based Detection of Loop Bounds," in Proc. of WCET, July 2007.
10. A. Ermedahl and J. Gustafsson, "Deriving Annotations for Tight Calculation of Execution Time," in Proc. of Euro-Par, August 1997.
11. A. Ermedahl, C. Sandberg, J. Gustafsson, S. Bygde, and B. Lisper, "Loop Bound Analysis based on a Combination of Program Slicing, Abstract Interpretation, and Invariant Analysis," in Proc. of WCET, July 2007.
12. P. Cousot and N. Halbwachs, "Automatic Discovery of Linear Restraints among Variables of a Program," in Proc. of POPL, January 1978.
13. P. Granger, "Static Analysis of Arithmetical Congruences," International Journal of Computer Mathematics, vol.30, no.30, pp. 165-190, 1989.
14. A. Miné, "The Octagon Abstract Domain," Higher Order Symbol. Comput., vol.19, no.1, pp. 31-100, 2006.
15. P. Cousot and R. Cousot, "Comparing the Galois Connection and Widening/Narrowing Approaches to Abstract Interpretation," in Proc. of PLILP, August 1992.
16. M. D. Weiser, "Program Slices: Formal, Psychological, and Practical Investigations of an Automatic Program Abstraction Method," Ph.D. dissertation, Ann Arbor, MI, USA, 1979.
17. J. Lyle and M. Weiser, "Automatic Program Bug Location by Program Slicing," in Proc. of International Conference on Computers and Applications, Feburary 1987.
18. T. Reps and G. Rosay, "Precise Interprocedural Chopping," in Proc. of SIGSOFT, October 1995.
19. S. Bates and S. Horwitz, "Incremental Program Testing Using Program Dependence Graphs," in Proc. of POPL, Jan. 1993.
20. J. Ferrante, K. J. Ottenstein, and J. D. Warren, "The Program Dependence Graph and its Use in Optimization," ACM Trans. Program. Lang. Syst., vol.9, no.3, pp. 319-349, 1987. (Pubitemid 17641083)
21. C. Sandberg, A. Ermedahl, J. Gustafsson, and B. Lisper, "Faster WCET Flow Analysis by Program Slicing," SIGPLAN Not., vol.41, no.7, pp. 103-112, 2006. (Pubitemid 44073107)
22. K. J. Ottenstein and L. M. Ottenstein, "The Program Dependence Graph in a Software Development Environment," SIGSOFT Softw. Eng. Notes, vol.9, no.3, pp. 177-184, 1984.
23. S. Horwitz, T. Reps, and D. Binkley, "Interprocedural Slicing Using Dependence Graphs," in Proc. of PLDI, June 1988.
24. H. Falk and P. Marwedel, "Control Flow driven Splitting of Loop Nests at the Source Code Level," in Proc. of DATE, Munich, Germany, March 2003.
25. H. Falk, Source Code Optimization Techniques for Data Flow Dominated Embedded Software. Kluwer Academic Publishers, 2004.
26. Z. Su and D. Wagner, "A Class of Polynomially Solvable Range Constraints for Interval Analysis without Widenings," Theor. Comput. Sci., 2005.
27. S. Verdoolaege, R. Seghir, K. Beyls, V. Loechner, and M. Bruynooghe, "Analytical Computation of Ehrhart Polynomials: Enabling More Compiler Analyses and Optimizations," in Proc of. CASES, September 2004.
28. D. Cordes, "Loop Analysis for a WCET-optimizing Compiler Based on Abstract Interpretation and Polylib (in German)," Master's thesis, TU Dortmund University, 2008.
29. Mälardalen WCET Research Group, "WCET Benchmarks," http://www.mrtc.mdh.se/projects/wcet, September 2008.
30. C. S. V. Zivojnovic, J. Martinez and H. Meyr, "DSPstone: A DSP-Oriented Benchmarking Methodology," in Proc. of ICSPAT, January 1994.
31. M. Guthaus, J. Ringenberg, D. Ernst, T. Austin, T. Mudge, and T. Brown, "MiBench: A Free, Commercially Representative Embedded Benchmark Suite," 2001.
32. C. Lee, M. Potkonjak, and W. H. Mangione-Smith, "Media- Bench: A Tool for Evaluating and Synthesizing Multimedia and Communications Systems," in Proc. of MICRO, December 1997.
33. "UTDSP Benchmark Suite," http://www.eecg.toronto.edu/ ̃corinna/DSP/infrastructure/UTDSP.html, September 2008.
34. Informatik Centrum Dortmund, "ICD-C Compiler framework," http://www.icd.de/es/icd-c, September 2008.
35. S. Verdoolaege, "Barvinok," http://http://www.kotnet.org/ ~skimo/barvinok, September 2008.
36. ICD Low Level Intermediate Representation Backend Infrastructure (LLIR) - Developer Manual. Informatik Centrum Dortmund, 2008.
37. AbsInt Angewandte Informatik GmbH, "Worst-Case Execution Time Analyzer aiT for TriCore," 2008.
38. H. Falk, P. Lokuciejewski, and H. Theiling, "Design of a WCET-Aware C Compiler," in Proc. of ESTIMedia, October 2006.