Recently there has been some discussion and problems constant timeliness notion in LLVM IR . As you may already know, LLVM IR, nor have, nor support any notion for cryptographic constant timeliness of optimizations in LLVM. There has been some research regarding secure code optimization [3, 5] and it is kind of possible to detect and test it easily . I was thinking it is a good idea to propose this as the Google Summer of Code project? and who code mentor me regarding this project?
There has been some primitive implementation for this . But it is nowhere near useable in real world, and needs a lot of improvement.