proposition: Lemma graph_rep_vertex_rep: forall g v, graph_has_v g v -> graph_rep g |-- EX sh: share, !!(writable_share sh) && vertex_rep sh g v * TT.
proof: Proof. intros. destruct H. sep_apply (graph_rep_generation_rep g (vgeneration v) H). red in H0. sep_apply (generation_rep_vertex_rep g (vgeneration v) _ H0). Exists (nth_sh g (vgeneration v)). destruct v. simpl. entailer!!. apply generation_share_writable. Qed.
imports: VST.veric.compcert_rmaps VST.msl.shares VST.msl.wand_frame VST.concurrency.conclib CertiGraph.lib.List_ext CertiGraph.msl_ext.log_normalize CertiGraph.msl_ext.ramification_lemmas CertiGraph.graph.graph_model CertiGraph.CertiGC.GCGraph CertiGraph.CertiGC.env_graph_gc CertiGraph.msl_ext.iter_sepcon Coq.Lists.List