Abstract Interpretation of FIFO Replacement

  • Daniel Grund
  • Jan Reineke
Conference paper

DOI: 10.1007/978-3-642-03237-0_10

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5673)
Cite this paper as:
Grund D., Reineke J. (2009) Abstract Interpretation of FIFO Replacement. In: Palsberg J., Su Z. (eds) Static Analysis. SAS 2009. Lecture Notes in Computer Science, vol 5673. Springer, Berlin, Heidelberg

Abstract

In hard real-time systems, the execution time of programs must be bounded by static timing analysis. For today’s embedded systems featuring caches, static analyses must predict cache hits and misses with high precision to obtain useful bounds. For caches with least-recently-used (LRU) replacement policy, efficient and precise cache analyses exist. However, for other widely-used policies like first-in first-out (FIFO), current cache analyses are much less precise.

This paper discusses challenges in FIFO cache analysis and advances the state of the art. We identify a generic framework for cache analysis that couples may- and must-analyses by means of domain cooperation. Our main contribution is a more precise may-analysis for FIFO. It not only increases the number of predicted misses, but also—due to the domain cooperation—the number of predicted hits. We instantiate the framework with a canonical must-analysis and three different may-analyses, including our new one, and compare the resulting three analyses to the collecting semantics. Our evaluation results characterize the progress achieved by our new may-analysis and reveal room for further improvement.

Keywords

Cache Analysis FIFO Replacement Domain Cooperation May/Must Reasoning 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Daniel Grund
    • 1
  • Jan Reineke
    • 1
  1. 1.Saarland UniversitySaarbrückenGermany

Personalised recommendations