fact: Definition less_spec := DECLARE _less WITH i : Z, j : Z, arr: val, arr_contents: list heap_item PRE [tuint, tuint, tptr t_item] PROP (0 <= i < Zlength arr_contents; 0 <= j < Zlength arr_contents; Zlength arr_contents <= Int.max_unsigned) PARAMS (Vint (Int.repr i); Vint (Int.repr j); arr) GLOBALS () SEP (harray arr_contents arr) POST [tint] PROP () LOCAL (temp ret_temp (Val.of_bool (cmp (Znth i arr_contents) (Znth j arr_contents)))) 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