Advisers: David Monniaux, Claire Maïza
In order to prove bounds on the execution time of programs, it is useful to know if memory accesses are in-cache or out of cache. One can do this by static analysis. Obviously, static analysis cannot always conclude (whether an access is in cache may depend on the execution path etc.) but one wants to reduce the cases where one cannot conclude.
For caches with LRU (least recently used) replacement policies, good analysis methods are known. The goal of the internship (which may lead into a PhD) is to look at other policies.