fact: Definition swim_spec := DECLARE _swim WITH i : Z, arr: val, arr_contents: list heap_item PRE [tuint, tptr t_item] PROP (0 <= i < Zlength arr_contents; weak_heap_ordered_bottom_up arr_contents i; Zlength arr_contents <= Int.max_unsigned) PARAMS (Vint (Int.repr i); arr) GLOBALS () SEP (harray arr_contents arr) POST [tvoid] EX arr_contents' : list (int * int), PROP (heap_ordered arr_contents'; Permutation arr_contents arr_contents') LOCAL () SEP (harray arr_contents' arr).
imports: RelationClasses Sorting VST.floyd.proofauto CertiGraph.binheap.binary_heap_model CertiGraph.binheap.binary_heap_Zmodel CertiGraph.binheap.binary_heap CertiGraph.binheap.env_binary_heap