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
..
Base.agda	Split the Language file into modules	2024-04-13 18:39:38 -07:00
Graphs.agda	Prove that graphs build by buildCfg are sufficient	2024-04-29 20:57:43 -07:00
Properties.agda	Prove that graphs build by buildCfg are sufficient	2024-04-29 20:57:43 -07:00
Semantics.agda	Add formalization of 'traces through graph'	2024-04-20 21:36:58 -07:00
Traces.agda	Prove that graphs build by buildCfg are sufficient	2024-04-29 20:57:43 -07:00