Time Applications

In previous work [1], we have developed the theoretical basis for the prediction of the cache behavior of pro-grams by abstract interpretation. Abstract interpreta-tion is a technique for the static analysis of dynamic properties of programs. It is semantics based, that is, it computes approximative properties of the semantics of programs. On this basis, it allows for correctness proofs of analyses. It thus replaces commonlyused ad hoc tech-niques by systematic, provable ones, and it allows the automatic generation of analyzers from specications as in the Program Analyzer Generator, PAG. In this paper, abstract semantics of machine programs are rened which determine the contents of caches. For interprocedural analysis, existing methods are examined and a new approach that is especially tailored for the analysis of hardware with states is presented. This al-lows for a static classication of the cache behavior of memory references of programs. The calculated infor-mation can be used to sharpen worst case execution time estimations. It is possible to analyze instruction, data, and combined instruction/data caches for com-mon (re)placement and write strategies. Experimental results are presented that demonstrate the applicability of the analysis