mirror of
https://github.com/kmc7468/cs220.git
synced 2025-12-12 21:08:45 +00:00
31 lines
663 B
Plaintext
31 lines
663 B
Plaintext
(* Euclidean division
|
|
|
|
1. Prove correctness of euclideian divison:
|
|
`division a b` returns an integer `q` such that
|
|
`a = bq+r` and `0 <= r < b` for some `r`.
|
|
|
|
- You have to strengthen the loop invariant.
|
|
*)
|
|
|
|
module Division
|
|
|
|
use int.Int
|
|
|
|
(* IMPORTANT: DON'T MODIFY LINES EXCEPT `TODO`s OR YOU WILL GET ZERO POINTS *)
|
|
let division (a b: int) : int
|
|
requires { a >= 0 }
|
|
requires { b > 0 }
|
|
ensures { exists r: int. a = b * result + r /\ 0 <= r < b }
|
|
=
|
|
let ref q = 0 in
|
|
let ref r = a in
|
|
while r >= b do
|
|
invariant { true (*TODO*) }
|
|
variant { r }
|
|
q <- q + 1;
|
|
r <- r - b
|
|
done;
|
|
q
|
|
|
|
end
|