Laure Gonnord, UCBL \/ Compsys<\/p>\n
R\u00e9sum\u00e9:<\/strong><\/p>\n \nJoined work with F. Pereira and his collegues @Univ Mineas Gerais, We validate these static analyses by incorporating our findings into In this talk I will present some of the static analyses that we <\/p>\n","protected":false},"excerpt":{"rendered":" Validation of Memory Accesses Through Symbolic Analyses Expos\u00e9 invit\u00e9 Aric, 12 mars 2015, 10h30 Laure Gonnord, UCBL \/ Compsys R\u00e9sum\u00e9: Joined work with F. Pereira and his collegues @Univ Mineas Gerais, Bresil. Published at oopsla’14 The C programming language does … Continue reading
\nBresil. Published at oopsla’14
\nThe C programming language does not prevent out-of-bounds memory
\naccesses. There exist several techniques to secure C programs;
\nhowever, these methods tend to slow down these programs substantially,
\nbecause they populate the binary code with runtime checks. To deal
\nwith this problem, we have designed and tested a succession of static
\nanalyses to remove the majority of these guards. <\/p>\n
\nAddressSanitizer : we generate SPEC CINT 2006 code that is 17% faster
\nand 9% more energy efficient than the code produced originally by this
\ntool. <\/p>\n
\ndesigned in this paper, focusing on our new “symbolic range” analysis,
\nand also the techniques we use to be able to scale well.<\/p>\n<\/blockquote>\n