Implement an analysis on top of a Program Dependency Graph. Please, see [1, 2, 3] to understand this representation for program analysis.
[1] Hammer, Christian, and Gregor Snelting. "Flow-sensitive, context-sensitive, and object-sensitive information flow control based on program dependence graphs." International Journal of Information Security 8.6 (2009): 399-422.
[2] Ferrante, Jeanne, Karl J. Ottenstein, and Joe D. Warren. "The program dependence graph and its use in optimization." ACM Transactions on Programming Languages and Systems (TOPLAS) 9.3 (1987): 319-349.
[3] Lengauer, Thomas, and Robert Endre Tarjan. "A fast algorithm for finding dominators in a flowgraph." ACM Transactions on Programming Languages and Systems (TOPLAS) 1.1 (1979): 121-141.
Implement an analysis on top of a Program Dependency Graph. Please, see [1, 2, 3] to understand this representation for program analysis.
[1] Hammer, Christian, and Gregor Snelting. "Flow-sensitive, context-sensitive, and object-sensitive information flow control based on program dependence graphs." International Journal of Information Security 8.6 (2009): 399-422.
[2] Ferrante, Jeanne, Karl J. Ottenstein, and Joe D. Warren. "The program dependence graph and its use in optimization." ACM Transactions on Programming Languages and Systems (TOPLAS) 9.3 (1987): 319-349.
[3] Lengauer, Thomas, and Robert Endre Tarjan. "A fast algorithm for finding dominators in a flowgraph." ACM Transactions on Programming Languages and Systems (TOPLAS) 1.1 (1979): 121-141.