Test for isolated subgraphs

GaloisInc / MATE

MATE is a suite of tools for interactive program analysis with a focus on hunting for bugs in C and C++ code using Code Property Graphs.

https://galoisinc.github.io/MATE/

BSD 3-Clause "New" or "Revised" License

179 stars 12 forks source link

Open langston-barrett opened 2 years ago

langston-barrett commented 2 years ago

We might want to define and test for some high level CPG invariants, such as:

Do we expect our CPG to be connected, i.e. for there to be a set of edges from any node to any other node?
If not, do we expect certain nodes or communities of nodes to always be orphaned/unconnected?

Migrated from internal (Gitlab) MATE issue number(s) 624