proposition: Lemma lmc_no_dangling_dst: forall g old new, no_dangling_dst g -> no_dangling_dst (lgraph_mark_copied g old new).
proof: Proof. repeat intro. simpl. rewrite <- lmc_graph_has_v in *. unfold get_edges in H1. rewrite lmc_make_fields in H1. apply (H v); 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