Added method computeBackwardThinSlice that takes a Collection
of Statements as seeds. git-svn-id: https://wala.svn.sourceforge.net/svnroot/wala/trunk@1631 f5eafffb-2e1d-0410-98e4-8ec43c5233c4
This commit is contained in:
parent
7f5f313f0c
commit
47cc86cea8
|
@ -79,6 +79,11 @@ public class CISlicer {
|
|||
return slice;
|
||||
}
|
||||
|
||||
public Collection<Statement> computeBackwardThinSlice(Collection<Statement> seeds) {
|
||||
Collection<Statement> slice = DFS.getReachableNodes(depGraph, seeds);
|
||||
return slice;
|
||||
}
|
||||
|
||||
/**
|
||||
* Compute the set of pointer keys each statement mods
|
||||
*/
|
||||
|
|
Loading…
Reference in New Issue