proposition: Lemma graph_rep_valid_int_or_ptr: forall g v, graph_has_v g v -> graph_rep g |-- !! (valid_int_or_ptr (vertex_address g v)).
proof: Proof. intros. sep_apply (graph_rep_vertex_rep g v H). Intros sh. sep_apply (vertex_rep_valid_int_or_ptr sh g v). entailer!!. 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