3807
|
1 |
(*
|
|
2 |
File: DBuffer.ML
|
|
3 |
Author: Stephan Merz
|
|
4 |
Copyright: 1997 University of Munich
|
|
5 |
|
|
6 |
Double FIFO buffer implements simple FIFO buffer.
|
|
7 |
*)
|
|
8 |
|
4089
|
9 |
val db_css = (claset(), simpset() addsimps [qc_def]);
|
3807
|
10 |
Addsimps [qc_def];
|
|
11 |
|
|
12 |
val db_defs = [BInit_def, Enq_def, Deq_def, Next_def, IBuffer_def, Buffer_def,
|
|
13 |
DBInit_def,DBEnq_def,DBDeq_def,DBPass_def,DBNext_def,DBuffer_def];
|
|
14 |
|
|
15 |
|
|
16 |
(*** Proper initialization ***)
|
|
17 |
goal DBuffer.thy "Init DBInit .-> Init (BInit inp qc out)";
|
|
18 |
by (auto_tac (db_css addsimps2 [Init_def,DBInit_def,BInit_def]));
|
|
19 |
qed "DBInit";
|
|
20 |
|
|
21 |
|
|
22 |
(*** Step simulation ***)
|
|
23 |
goal DBuffer.thy "[DBNext]_<inp,mid,out,q1,q2> .-> [Next inp qc out]_<inp,qc,out>";
|
|
24 |
by (rtac square_simulation 1);
|
|
25 |
by (Action_simp_tac 1);
|
4089
|
26 |
by (action_simp_tac (simpset() addsimps hd_append::db_defs) [] [] 1);
|
3807
|
27 |
qed "DB_step_simulation";
|
|
28 |
|
|
29 |
|
|
30 |
(*** Simulation of fairness ***)
|
|
31 |
|
|
32 |
(* Compute enabledness predicates for DBDeq and DBPass actions *)
|
|
33 |
goal DBuffer.thy "<DBDeq>_<inp,mid,out,q1,q2> .= DBDeq";
|
|
34 |
by (auto_tac (db_css addsimps2 [angle_def,DBDeq_def,Deq_def]));
|
|
35 |
qed "DBDeq_visible";
|
|
36 |
|
|
37 |
goal DBuffer.thy "$Enabled (<DBDeq>_<inp,mid,out,q1,q2>) .= ($q2 .~= .[])";
|
|
38 |
by (rewtac (action_rewrite DBDeq_visible));
|
|
39 |
by (cut_facts_tac [DB_base] 1);
|
|
40 |
by (auto_tac (db_css addSEs2 [base_enabled,enabledE]
|
|
41 |
addsimps2 [angle_def,DBDeq_def,Deq_def]));
|
|
42 |
qed "DBDeq_enabled";
|
|
43 |
|
|
44 |
goal DBuffer.thy "<DBPass>_<inp,mid,out,q1,q2> .= DBPass";
|
|
45 |
by (auto_tac (db_css addsimps2 [angle_def,DBPass_def,Deq_def]));
|
|
46 |
qed "DBPass_visible";
|
|
47 |
|
|
48 |
goal DBuffer.thy "$Enabled (<DBPass>_<inp,mid,out,q1,q2>) .= ($q1 .~= .[])";
|
|
49 |
by (rewtac (action_rewrite DBPass_visible));
|
|
50 |
by (cut_facts_tac [DB_base] 1);
|
|
51 |
by (auto_tac (db_css addSEs2 [base_enabled,enabledE]
|
|
52 |
addsimps2 [angle_def,DBPass_def,Deq_def]));
|
|
53 |
qed "DBPass_enabled";
|
|
54 |
|
|
55 |
|
|
56 |
(* The plan for proving weak fairness at the higher level is to prove
|
|
57 |
(0) DBuffer => (Enabled (Deq inp qc out) ~> (Deq inp qc out))
|
|
58 |
which is in turn reduced to the two leadsto conditions
|
|
59 |
(1) DBuffer => (Enabled (Deq inp qc out) ~> q2 ~= [])
|
|
60 |
(2) DBuffer => (q2 ~= [] ~> DBDeq)
|
|
61 |
and the fact that DBDeq implies <Deq inp qc out>_<inp,qc,out>
|
|
62 |
(and therefore DBDeq ~> <Deq inp qc out>_<inp,qc,out> trivially holds).
|
|
63 |
|
|
64 |
Condition (1) is reduced to
|
|
65 |
(1a) DBuffer => (qc ~= [] /\ q2 = [] ~> q2 ~= [])
|
|
66 |
by standard leadsto rules (leadsto_classical) and rule Deq_enabledE.
|
|
67 |
|
|
68 |
Both (1a) and (2) are proved from DBuffer's WF conditions by standard
|
|
69 |
WF reasoning (Lamport's WF1 and WF_leadsto).
|
|
70 |
The condition WF(Deq inp qc out) follows from (0) by rule leadsto_WF.
|
|
71 |
|
|
72 |
One could use Lamport's WF2 instead.
|
|
73 |
*)
|
|
74 |
|
|
75 |
(* Condition (1a) *)
|
|
76 |
goal DBuffer.thy
|
|
77 |
"[][DBNext]_<inp,mid,out,q1,q2> .& WF(DBPass)_<inp,mid,out,q1,q2> \
|
|
78 |
\ .-> ($qc .~= .[] .& $q2 .= .[] ~> $q2 .~= .[])";
|
|
79 |
by (rtac WF1 1);
|
4089
|
80 |
by (action_simp_tac (simpset() addsimps square_def::db_defs) [] [] 1);
|
|
81 |
by (action_simp_tac (simpset() addsimps [angle_def,DBPass_def]) [] [] 1);
|
|
82 |
by (action_simp_tac (simpset() addsimps [DBPass_enabled]) [] [] 1);
|
3807
|
83 |
qed "DBFair_1a";
|
|
84 |
|
|
85 |
(* Condition (1) *)
|
|
86 |
goal DBuffer.thy
|
|
87 |
"[][DBNext]_<inp,mid,out,q1,q2> .& WF(DBPass)_<inp,mid,out,q1,q2> \
|
|
88 |
\ .-> ($Enabled (<Deq inp qc out>_<inp,qc,out>) ~> $q2 .~= .[])";
|
|
89 |
by (auto_tac (temp_css addSIs2 [leadsto_classical] addSEs2 [temp_conjimpE DBFair_1a]));
|
|
90 |
by (auto_tac (temp_css addsimps2 [leadsto,Init_def] addDs2 [STL2bD]
|
|
91 |
addSDs2 [action_mp Deq_enabledE] addSEs2 [STL4E]));
|
|
92 |
qed "DBFair_1";
|
|
93 |
|
|
94 |
(* Condition (2) *)
|
|
95 |
goal DBuffer.thy
|
|
96 |
"[][DBNext]_<inp,mid,out,q1,q2> .& WF(DBDeq)_<inp,mid,out,q1,q2> \
|
|
97 |
\ .-> ($q2 .~= .[] ~> DBDeq)";
|
|
98 |
by (rtac WF_leadsto 1);
|
4089
|
99 |
by (action_simp_tac (simpset() addsimps [DBDeq_visible,DBDeq_enabled]) [] [] 1);
|
|
100 |
by (action_simp_tac (simpset() addsimps [angle_def]) [] [] 1);
|
|
101 |
by (action_simp_tac (simpset() addsimps square_def::db_defs) [tempI] [Stable] 1);
|
3807
|
102 |
qed "DBFair_2";
|
|
103 |
|
|
104 |
(* High-level fairness *)
|
|
105 |
goal DBuffer.thy
|
|
106 |
"[][DBNext]_<inp,mid,out,q1,q2> .& WF(DBPass)_<inp,mid,out,q1,q2> \
|
|
107 |
\ .& WF(DBDeq)_<inp,mid,out,q1,q2> \
|
|
108 |
\ .-> WF(Deq inp qc out)_<inp,qc,out>";
|
|
109 |
by (auto_tac (db_css addSIs2 [leadsto_WF]));
|
|
110 |
by (auto_tac (db_css addSIs2 [(temp_mp DBFair_1) RSN(2,LatticeTransitivity)]));
|
|
111 |
by (auto_tac (db_css addSIs2 [(temp_mp DBFair_2) RSN(2,LatticeTransitivity)]));
|
|
112 |
by (auto_tac (db_css addSIs2 [ImplLeadsto] addSEs2 [STL4E]
|
|
113 |
addsimps2 [angle_def,DBDeq_def,Deq_def,hd_append]));
|
|
114 |
qed "DBFair";
|
|
115 |
|
|
116 |
(*** Main theorem ***)
|
|
117 |
goalw DBuffer.thy [DBuffer_def,Buffer_def,IBuffer_def] "DBuffer .-> Buffer inp out";
|
|
118 |
by (auto_tac (db_css addSIs2 (map temp_mp [eexI,DBInit,DB_step_simulation RS STL4,DBFair])));
|
|
119 |
qed "DBuffer_impl_Buffer";
|