Looking for any kind of related work, especially in static analysis or graph algorithms.
-
-
Show this thread
-
Some cool properties: * A node's ancestors = backward slice (and descendants = forward). * Weakly connected components are independent computations, so they could be e.g. parallelized or trivially factored. * Any topological sort is a valid reordering of the program.
Show this thread
End of conversation
New conversation -
-
-
I don’t have an answer but was just wondering about this
https://twitter.com/Westoncb/status/1462211544641523719 … -
Flowistry / slicing seems pretty close to what you want! Although not sure how you would assign weight to influence.https://github.com/willcrichton/flowistry …
- Show replies
New conversation -
-
-
Might not be exactly what you're asking, but: PEGs are like dataflow graphs, but faithfully represent loops, exceptions, and mutation https://www.jameskoppel.com/files/papers/yogo.pdf … https://www.cs.cornell.edu/~ross/publications/eqsat/ …
-
Yes this is definitely what I'm looking for! PEG seems like representing imperative code in a purely functional form via an explicit memory object. The diff from my graph is that mutations are accumulated into a global memory, rather than tracking on the variable-level.
- Show replies
New conversation -
-
-
I have seen some SSA-like approaches. I think most added the CFG node id to the analysis and have a 'next' relation for the nodes, like 'A Datalog Model of Must-Alias Analysis'
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.
cognitive psychology. PhD
?