Compute Program Dependence Graphs
AbstractProgram dependence graphs (PDGs) form an essential element for slicing. The reaching definitions analysis is particularly well suited to derive a clean and precise implementation of program dependence graphs, because it is field-sensitive.
Make SAMATE Tests Work
Read this paper http://www.sciencedirect.com/science/article/pii/S0950584913000384 and make the tests mentioned in there work.