Marek Chalupa
Marek Chalupa
What does `llvm-slicer` say about the "matched slicing criteria"? Indeed, lines 60, 64, and 65 do not seem to be dependencies of 68, but that would not be a problem,...
> would not be a problem, just an imprecision. Is this imprecision common in dg? Depends on the program and the features it uses. Imprecision is common in any static...
> okay. Thanks. So "-forward" print both the forward slcing and backward slicing. Not exactly. `-forward` does forward slice and then it takes the instructions from the forward slice and...
There is none atm, but control and data dependence analysis support intra-procedural computation: https://github.com/mchalupa/dg/search?q=intraproc and all analyses should support specifying the entry point, so it should not be that hard...
Hi, if an instruction does not have corresponding PSNode, it means that it can not keep any pointer. Therefore, it is OK that the store does not have a PSNode...
Exactly! No problem ;)
What is the bitcode? How big is the program?
Seems that the bitcode is just too complicated for the analyses (points-to analysis), so it just computes very long. The points-to analysis in DG is very inefficient...
It depends on what do you mean by "show how the input can affect XXX". DG can compute an interprocedural dependence graph and from that you can get the information...
By path you mean a path in the CFG of the program? From the dependence graph, all the statements that are backward reachable from the ,,destination'' instructions may affect the...