A Fast and Precise Static Loop Analysis Based on Abstract Interpretation, Program Slicing and Polytope Models

  • Authors:

  • Paul Lokuciejewski;Daniel Cordes;Heiko Falk;Peter Marwedel

  • Affiliations:

  • Computer Science 12, Embedded Systems Group, D-44221 Dortmund, Germany;Computer Science 12, Embedded Systems Group, D-44221 Dortmund, Germany;Computer Science 12, Embedded Systems Group, D-44221 Dortmund, Germany;Computer Science 12, Embedded Systems Group, D-44221 Dortmund, Germany

  • Venue:
  • Proceedings of the 7th annual IEEE/ACM International Symposium on Code Generation and Optimization
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

A static loop analysis is a program analysis computing loop iteration counts. This information is crucial for different fields of applications. In the domain of compilers, the knowledge about loop iterations can be exploited for aggressive loop optimizations like Loop Unrolling. A loop analyzer also provides static information about code execution frequencies which can assist feedback-directed optimizations. Another prominent application is the static worst-case execution time (WCET) analysis which relies on a safe approximation of loop iteration counts.In this paper, we propose a framework for a static loop analysis based on Abstract Interpretation, a theory of a sound approximation of program semantics. To accelerate the analysis, we preprocess the analyzed code using Program Slicing, a technique that removes statements irrelevant forthe loop analysis. In addition, we introduce a novel polytope-based loop evaluation that further significantly reduces the analysis time. The efficiency of our loop analyzer is evaluated on a large number of benchmarks. Results show that 99% of the considered loops could be successfully analyzed in an acceptable amount of time. This study points out that our methodology is best suited for real-world problems.