proposition: Lemma svwl_no_dangling_dst: forall from to l g1 g2, graph_has_gen g1 to -> scan_vertex_while_loop from to l g1 g2 -> gen_unmarked g1 to -> copy_compatible g1 -> from <> to -> no_dangling_dst g1 -> no_dangling_dst g2.
proof: Proof. do 3 intro. induction l; intros; inversion H0; subst; [assumption | eapply IHl; eauto|]. cut (no_dangling_dst g3). - intros. apply (IHl g3); auto. + erewrite <- svfl_graph_has_gen; eauto. + eapply svfl_gen_unmarked; eauto. + eapply svfl_copy_compatible; eauto. - eapply (svfl_no_dangling_dst from to _ _ g1); eauto. + split; simpl; assumption. + unfold no_scan in H8; lia. + intros. rewrite nat_inc_list_In_iff in H5. assumption. Qed.
imports: Coq.ZArith.ZArith Coq.Program.Basics Coq.micromega.Lia 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 VST.zlist.list_solver CertiGraph.lib.EquivDec_ext CertiGraph.lib.List_ext CertiGraph.graph.graph_model CertiGraph.graph.graph_gen