File: loop_ce.mlw

package info (click to toggle)
why3 1.8.2-3
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid
  • size: 45,028 kB
  • sloc: xml: 185,443; ml: 111,224; ansic: 3,998; sh: 2,578; makefile: 2,568; java: 865; python: 720; javascript: 290; lisp: 205; pascal: 173
file content (33 lines) | stat: -rw-r--r-- 340 bytes parent folder | download | duplicates (2) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
 

module M1

use int.Int

let ref a = 0

let ref b = 0

let f () =
  a <- -1;
  a <- 1;
  b <- 2;
  while b < 10 do
    variant { 10 - b }
    invariant { b - a < 5 }
    b <- b + a;
  done

end

module M2

use int.Int

let g (ref a: int)
  ensures { a = old a + 1 }
=
  label X in
  if a <> 10 then a <- a + 1;
  assert { a = a at X }

end