Computing Same Block Relations for Relational Cache Analysis

Author Simon Wegener

Thumbnail PDF


  • Filesize: 488 kB
  • 13 pages

Document Identifiers

Author Details

Simon Wegener

Cite AsGet BibTex

Simon Wegener. Computing Same Block Relations for Relational Cache Analysis. In 12th International Workshop on Worst-Case Execution Time Analysis. Open Access Series in Informatics (OASIcs), Volume 23, pp. 25-37, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)


In contrast to the classical cache analysis of Ferdinand, the relational cache analysis does not rely on precise address information. Instead, it uses same block relations between memory accesses to predict cache hits. The relational data cache analysis can thus also predict cache hits if fully unrolling a loop is not feasible during analysis, for example due to high memory consumption or long computation time. This paper proposes a static analysis based on abstract interpretation which is able to compute same block relations for relational cache analysis.
  • Cache Analysis
  • WCET Analysis
  • Real-time Systems
  • Static Program Analysis
  • Abstract Interpretation


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail