Commit 1c47e80c by Jean-Christophe Filliâtre

### two more programs for the nightly bench

parent acff993f
 ... ... @@ -152,7 +152,6 @@ why.conf /examples/programs/course/ /examples/programs/wcet_hull/ /examples/programs/binary_search2/ /examples/programs/vacid_0_sparse_array/ /examples/programs/vacid_0_red_black_trees/ /examples/programs/vacid_0_red_black_trees_harness/ /examples/programs/next_digit_sum/ ... ... @@ -160,7 +159,6 @@ why.conf /examples/programs/vstte10_search_list/ /examples/programs/vstte10_aqueue/ /examples/programs/mergesort_list/ /examples/programs/same_fringe/ /examples/programs/algo63/ /examples/programs/algo64/ /examples/programs/algo65/ ... ...

 ... ... @@ -93,10 +93,7 @@ back +-+-+-+-------------------+ let test (a: sparse_array) i = { 0 <= i < length a and invariant_ a } let idx = idx a in let back = back a in let n = card a in 0 <= idx[i] && idx[i] < n && back[idx[i]] = i 0 <= a.idx[i] && a.idx[i] < a.card && a.back[a.idx[i]] = i { result=True <-> is_elt a i } let get (a: sparse_array) i = ... ... @@ -109,17 +106,12 @@ back +-+-+-+-------------------+ let set (a: sparse_array) i v = { 0 <= i < length a and invariant_ a } (* let SA val idx back sz n = !a in *) let val = val a in let idx = idx a in let back = back a in let n = card a in val[i] <- v; a.val[i] <- v; if not (test a i) then begin assert { n < length a }; idx[i] <- n; back[n] <- i; () (*TODO a.card <- n+1 *) assert { a.card < length a }; a.idx[i] <- a.card; a.back[a.card] <- i; a.card <- a.card + 1 end { invariant_ a and model a i = v and ... ...

 ... ... @@ -3,19 +3,19 @@ ... ... @@ -23,24 +23,24 @@ ... ...
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!