18 citations · 19 across the 4 of their papers we have counts for
5 papers
Leveraging LLVM's ScalarEvolution for Symbolic Data Cache Analysis
Valentin Touzeau, Jan Reineke
While instruction cache analysis is essentially a solved problem, data cache analysis is more challenging. In contrast to instruction fetches, the data accesses generated by a memo…
Fast and exact analysis for LRU caches
Claire Maïza, Valentin Touzeau, David Monniaux +1
For applications in worst-case execution time analysis and in security, it is desirable to statically classify memory accesses into those that result in cache hits, and those that…
On the complexity of cache analysis for different replacement policies
David Monniaux, Valentin Touzeau
Modern processors use cache memory: a memory access that "hits" the cache returns early, while a "miss" takes more time. Given a memory access in a program, cache analysis consists…
Ascertaining Uncertainty for Efficient Exact Cache Analysis
Valentin Touzeau, Claire Maïza, David Monniaux +1
Static cache analysis characterizes a program's cache behavior by determining in a sound but approximate manner which memory accesses result in cache hits and which result in cache…
Model Checking of Cache for WCET Analysis Refinement
Valentin Touzeau, Claire Maïza, David Monniaux
On real-time systems running under timing constraints, scheduling can be performed when one is aware of the worst case execution time (WCET) of tasks. Usually, the WCET of a task i…