Paper notes: Interprocedural program analysis

I have been reading/thinking about interprocedural (binary mostly) program analysis lately. There are two ways to do it: a) function summaries produced in advance; b) inlining function bodies and (try to) do whole-program analysis. The problem with a) is (possible) reduced accuracy, and with b) scalability.

Have I missed something? Any pointers to relevant work?

Program analysis Jedi @jvanegue suggested SLAM and Daikon.

Relevant Twitter link: https://twitter.com/_argp/statuses/514491405142863872