Subgraph DF Matching

[EagleoutIce]

Implement a graph comparisons which allows one graph to be a subgraph of the other. This allows us to express fragments of the DF graph. On that note:

• it would be nice to support other things like wildcards
• surely, with just a little bit of translation, we can use an existing library for this.

[EagleoutIce]

additionally we want to have behavioral equivalence tests checking df dependencies with real execution of known files.

[EagleoutIce]

i.e., execute the code and check that the output is the same as the DF dependence suggests with abstract interpretation we want to further check if all intervals domains are met

[EagleoutIce]

Furthermore it would be nice if ids could be mapped so that i can write '14' for vertex and edges in the subgraph to test for even if flowR changes the id system or the code is extended etc...

[EagleoutIce]

How about a query like .canReach('14', '22', [EdgeType.Reads]) to indicate that vertex 14 can reach 22 only with reads edges.

[EagleoutIce]

:cloud: future dream: a way to search other code with wildcard dataflow subgraphs.