@@ -8,7 +8,7 @@ op p2: int -> bool.
88
99module M' ={
1010 proc truc (x:int) : int = {
11- if (! p1 x \/ ! p2 x) else raise assume;
11+ if (! p1 x \/ ! p2 x) else raise assume;
1212 if (!p1 x \/ !p2 x) { raise assert;}
1313 return x;
1414 }
@@ -17,7 +17,7 @@ module M' ={
1717print M' .
1818
1919lemma assume_assert (_x:int ):
20- hoare [M'.truc : _x = x ==>
20+ hoare [M'.truc : _x = x ==>
2121 false | assume => p1 _x | assert => !(p1 _x /\ p2 _x)
2222 ].
2323proof.
2929print assume_assert.
3030
3131lemma assert_assume (_x:int ):
32- hoare [M'.truc : _x = x ==>
33- false | assume => p2 _x | assert => !(p2 _x /\ p1 _x)
32+ hoare [M'.truc : _x = x ==>
33+ false | assume => p2 _x | assert => !(p2 _x /\ p1 _x)
3434 ].
3535proof.
3636 proc.
3939qed.
4040
4141lemma assert_assume' ( _x:int) :
42- hoare [M' .truc : _x = x ==>
42+ hoare [M' .truc : _x = x ==>
4343 false | assume => p1 _x /\ p2 _x | assert => !(p2 _x /\ p1 _x) ].
4444proof.
4545 conseq (assume_assert _x) (assert_assume _x).
@@ -101,7 +101,7 @@ proof.
101101 + call (: _x = x ==> res = 5 | e1 => 3 = _x | e2 => pd2 | _ => pd2).
102102 + proc.
103103 by auto.
104- auto.
104+ auto.
105105 smt(a3 a4).
106106 call (l_f1 _x).
107107 auto. smt(a5 a3 a4).
@@ -181,22 +181,18 @@ module M3 = {
181181
182182}.
183183
184- lemma test5 :
184+ lemma test5 :
185185 hoare [M3 .f : true ==> false | arg1 x => x = 3 ].
186186proof.
187187 proc. wp. skip => // .
188188qed.
189189
190- lemma test6 :
190+ lemma test6 :
191191 hoare [M3 .f : true ==> false | arg1 x => x = 3 ].
192192proof.
193193 conseq (: _ ==> _ | arg1 x => 3 = x).
194194 + done.
195195 proc. wp. skip => // .
196196qed.
197197
198-
199-
200-
201-
202- exception arg ['a] of 'a.
198+ (* exception arg [' a] of ' a. *)
0 commit comments