equal
deleted
inserted
replaced
5 |
5 |
6 Weak Fairness versions of transient, ensures, leadsTo. |
6 Weak Fairness versions of transient, ensures, leadsTo. |
7 |
7 |
8 From Misra, "A Logic for Concurrent Programming", 1994 |
8 From Misra, "A Logic for Concurrent Programming", 1994 |
9 *) |
9 *) |
|
10 |
|
11 (** Ad-hoc set-theory rules **) |
|
12 |
|
13 Goal "Union(B) Int A = (UN b:B. b Int A)"; |
|
14 by Auto_tac; |
|
15 qed "Int_Union_Union"; |
|
16 |
|
17 Goal "A Int Union(B) = (UN b:B. A Int b)"; |
|
18 by Auto_tac; |
|
19 qed "Int_Union_Union2"; |
10 |
20 |
11 (*** transient ***) |
21 (*** transient ***) |
12 |
22 |
13 Goalw [transient_def] "transient(A)<=program"; |
23 Goalw [transient_def] "transient(A)<=program"; |
14 by Auto_tac; |
24 by Auto_tac; |