Computer Aided Verification
By Valentin Touzeau, Claire Maïza, David Monniaux, Jan Reineke. Lecture Notes in Computer Science, 2017
799 citations recorded by the source corpus.
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 misses. Such information is valuable in optimizing compilers, worst-case execution time analysis, and side-channel attack quantification and mitigation.
Subfields: Artificial Intelligence
View Paper: https://www.semanticscholar.org/paper/b434af9d2702080136f2ed42457c7866abb0f280
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Juan Gómez-Luna
- Onur Mutlu
- Dean M. Tullsen
- Rachata Ausavarungnirun
- Saugata Ghose
- Craig Gidney
- Martin Ekerå
Citations in the corpus
- Horton Tables: Fast Hash Tables for In-Memory Data-Intensive Computing (2016, background): “KV ′ is then subsequently ∗This author is also a PhD student at UC San Diego.”
- Processing Data Where It Makes Sense: Enabling In-Memory Computation (2019, background): “Unfortunately, it has become increasingly difficult in recent years to scale all of these dimensions [1, 2, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31], and the main memory bottleneck has instead been worsening.”