proposition: Lemma fold_linked_heap_array: forall L1 v1 L2 v2, linked_correctly L1 L2 -> (heap_array L1 v1) * (lookup_array L2 v2) |-- linked_heap_array L1 v1 L2 v2.
proof: Proof. intros. unfold linked_heap_array. entailer!. Qed.
imports: RelationClasses VST.floyd.proofauto CertiGraph.lib.List_ext CertiGraph.binheap.binary_heap_pro CertiGraph.binheap.binary_heap_malloc_spec CertiGraph.binheap.binary_heap_model CertiGraph.binheap.binary_heap_Zmodel