Danila Fedorin c574ca9c56 Prove that graphs build by buildCfg are sufficient ...

That is, if we have a (semantic) trace, we can
find a corresponding path through the CFG.

Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>

2024-04-29 20:57:43 -07:00

13 KiB

Raw Blame History

View Raw