Svadev mailing list

[leckie peng <pengjingjian1016 AT gmail.com>]

Hi,

I am a MSc candidate and very interested in the open project that creates common infrastructure for memory safety tools. To finish my degree I've been working on it for a while and read some of the literature. 

As for eliminating redundant checks, which is among the goals of this project, I was considering if we can employ data flow analysis to transfer the "safety" of the memory address along CFG. Namely, if one memory access has been checked, it's possible that accesses to the same location down the execution paths don't need to be checked if the "safety" of the location can be transferred there. This is a simple idea and can be implemented with classic bit vector data flow analysis. It seems to me that the optimizations implemented in ASan and those by Ott Tinn didn't use this approach, although they can eliminate a large part of redundant checks by now, by using much analysis. This data flow approach, however, seems to me more elegant and straightforward. I don't have much experience with Compiler Techniques, it would be great to have your opinions.

Best regards.

--Jian Peng