proposition: Lemma generation_rep_ptrofs: forall g gen b i, Vptr b i = gen_start g gen -> generation_rep g gen |-- !! (WORD_SIZE * graph_gen_size g gen + Ptrofs.unsigned i < Ptrofs.modulus).
proof: Proof. intros. apply (iter_sepcon_vertex_rep_ptrofs g gen b i). assumption. 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