Cache analysis in presence of pointer-based data structures

Abstract

Cache analysis plays a crucial part when analyzing the WCET of an application. This paper presents ongoing work aiming at a precise cache analysis in the presence of pointer-based, heap-allocated data structures. The proposed analysis achieves precision by augmenting its abstract cache states with information about the structure of the program's allocated objects as well as a short term access history of these objects. This additional information is derived from an adapted shape analysis that serves as an pre-analysis phase to our actual cache analysis.