3 Commits

Author	SHA1	Message	Date
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
Danila Fedorin	ab40a27e78	Formulate correctness of buildCfg using end-to-end traces ... Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>	2024-04-27 14:56:19 -07:00
Danila Fedorin	e218d1b7a3	Add formalization of 'traces through graph' ... Signed-off-by: Danila Fedorin <danila.fedorin@gmail.com>	2024-04-20 21:36:58 -07:00