proposition: Lemma heap_struct_rep_split_single: forall sh l heap_p i, 0 <= i < MAX_SPACES -> Zlength l = MAX_SPACES -> exists B, heap_struct_rep sh l heap_p = data_at sh space_type (Znth i l) (space_address heap_p (Z.to_nat i)) * B.
proof: Proof. intros. eexists. erewrite hsr_single_explicit; eauto. 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