fact: Definition gc_graph_quasi_iso (g1: LGraph) (roots1: roots_t) (g2: LGraph) (roots2: roots_t) (from to: nat): Prop := is_partial_graph g1 g2 /\ exists (l: list (VType * VType)), roots2 = roots_map l roots1 /\ (forall v1 v2, In (v1, v2) l -> vlabel g1 v1 = vlabel g2 v2 /\ forall idx, In idx (map snd (get_edges g1 v1)) -> (dst g2 (v2, idx) = dst g1 (v1, idx) \/ dst g2 (v2, idx) = list_bi_map l (dst g1 (v1, idx)))) /\ let (from_l, to_l) := split l in from_gen_quasi_spec g1 roots1 from_l from /\ to_gen_spec g1 g2 to_l to /\ forall v, vvalid g1 v -> ~ In v from_l -> vlabel g1 v = vlabel g2 v.
imports: Coq.ZArith.ZArith Coq.Program.Basics compcert.lib.Integers compcert.common.Values VST.veric.base VST.veric.Clight_lemmas VST.veric.val_lemmas VST.veric.shares VST.msl.seplog VST.msl.shares VST.zlist.sublist VST.floyd.coqlib3 VST.floyd.functional_base VST.floyd.data_at_rec_lemmas CertiGraph.lib.Coqlib CertiGraph.lib.EquivDec_ext CertiGraph.lib.List_ext CertiGraph.graph.graph_model CertiGraph.graph.graph_gen CertiGraph.graph.path_lemmas CertiGraph.graph.subgraph2 CertiGraph.graph.graph_relation CertiGraph.graph.graph_isomorphism CertiGraph.graph.reachable_ind CertiGraph.CertiGC.GCGraph