proof.v 8.7 KB
Newer Older
1 2 3
From iris.program_logic Require Export weakestpre.
From iris.heap_lang Require Export lang.
From iris.heap_lang.lib.barrier Require Export barrier.
4
From iris.prelude Require Import functions.
5
From iris.base_logic Require Import big_op lib.saved_prop lib.sts.
Robbert Krebbers's avatar
Robbert Krebbers committed
6
From iris.heap_lang Require Import proofmode.
Ralf Jung's avatar
Ralf Jung committed
7
From iris.heap_lang.lib.barrier Require Import protocol.
8

9
(** The CMRAs/functors we need. *)
10 11
(* Not bundling heapG, as it may be shared with other users. *)
Class barrierG Σ := BarrierG {
12 13
  barrier_stsG :> stsG Σ sts;
  barrier_savedPropG :> savedPropG Σ idCF;
14
}.
15
Definition barrierΣ : gFunctors := #[stsΣ sts; savedPropΣ idCF].
16

17 18
Instance subG_barrierΣ {Σ} : subG barrierΣ Σ  barrierG Σ.
Proof. intros [? [? _]%subG_inv]%subG_inv. split; apply _. Qed.
19 20 21

(** Now we come to the Iris part of the proof. *)
Section proof.
22
Context `{!heapG Σ, !barrierG Σ} (N : namespace).
Robbert Krebbers's avatar
Robbert Krebbers committed
23
Implicit Types I : gset gname.
24

25 26
Definition ress (P : iProp Σ) (I : gset gname) : iProp Σ :=
  ( Ψ : gname  iProp Σ,
27
     (P - [ set] i  I, Ψ i)  [ set] i  I, saved_prop_own i (Ψ i))%I.
28 29

Coercion state_to_val (s : state) : val :=
30
  match s with State Low _ => #false | State High _ => #true end.
Robbert Krebbers's avatar
Robbert Krebbers committed
31
Arguments state_to_val !_ / : simpl nomatch.
32

33
Definition state_to_prop (s : state) (P : iProp Σ) : iProp Σ :=
34
  match s with State Low _ => P | State High _ => True%I end.
Robbert Krebbers's avatar
Robbert Krebbers committed
35
Arguments state_to_prop !_ _ / : simpl nomatch.
36

37
Definition barrier_inv (l : loc) (P : iProp Σ) (s : state) : iProp Σ :=
38
  (l  s  ress (state_to_prop s P) (state_I s))%I.
39

40
Definition barrier_ctx (γ : gname) (l : loc) (P : iProp Σ) : iProp Σ :=
41
  sts_ctx γ N (barrier_inv l P).
42

43
Definition send (l : loc) (P : iProp Σ) : iProp Σ :=
44
  ( γ, barrier_ctx γ l P  sts_ownS γ low_states {[ Send ]})%I.
45

46
Definition recv (l : loc) (R : iProp Σ) : iProp Σ :=
47
  ( γ P Q i,
48 49
    barrier_ctx γ l P  sts_ownS γ (i_states i) {[ Change i ]} 
    saved_prop_own i Q   (Q - R))%I.
50

51
Global Instance barrier_ctx_persistent (γ : gname) (l : loc) (P : iProp Σ) :
52
  PersistentP (barrier_ctx γ l P).
53 54 55 56
Proof. apply _. Qed.

Typeclasses Opaque barrier_ctx send recv.

57
(** Setoids *)
58 59 60 61
Global Instance ress_ne n : Proper (dist n ==> (=) ==> dist n) ress.
Proof. solve_proper. Qed.
Global Instance state_to_prop_ne n s :
  Proper (dist n ==> dist n) (state_to_prop s).
62
Proof. solve_proper. Qed.
63
Global Instance barrier_inv_ne n l :
64 65
  Proper (dist n ==> eq ==> dist n) (barrier_inv l).
Proof. solve_proper. Qed.
66
Global Instance barrier_ctx_ne n γ l : Proper (dist n ==> dist n) (barrier_ctx γ l).
67
Proof. solve_proper. Qed. 
68
Global Instance send_ne n l : Proper (dist n ==> dist n) (send l).
69
Proof. solve_proper. Qed.
70
Global Instance recv_ne n l : Proper (dist n ==> dist n) (recv l).
71
Proof. solve_proper. Qed.
72 73

(** Helper lemmas *)
74
Lemma ress_split i i1 i2 Q R1 R2 P I :
75
  i  I  i1  I  i2  I  i1  i2 
76 77 78
  saved_prop_own i Q - saved_prop_own i1 R1 - saved_prop_own i2 R2 -
  (Q - R1  R2) - ress P I -
  ress P ({[i1;i2]}  I  {[i]}).
79
Proof.
80
  iIntros (????) "#HQ #H1 #H2 HQR"; iDestruct 1 as (Ψ) "[HPΨ HΨ]".
81
  iDestruct (big_sepS_delete _ _ i with "HΨ") as "[#HΨi HΨ]"; first done.
Robbert Krebbers's avatar
Robbert Krebbers committed
82
  iExists (<[i1:=R1]> (<[i2:=R2]> Ψ)). iSplitL "HQR HPΨ".
83
  - iPoseProof (saved_prop_agree i Q (Ψ i) with "[#]") as "Heq"; first by iSplit.
84 85 86
    iNext. iRewrite "Heq" in "HQR". iIntros "HP". iSpecialize ("HPΨ" with "HP").
    iDestruct (big_sepS_delete _ _ i with "HPΨ") as "[HΨ HPΨ]"; first done.
    iDestruct ("HQR" with "HΨ") as "[HR1 HR2]".
87
    rewrite -assoc_L !big_sepS_fn_insert'; [|abstract set_solver ..].
88
    by iFrame.
89
  - rewrite -assoc_L !big_sepS_fn_insert; [|abstract set_solver ..]. eauto.
90
Qed.
91 92

(** Actual proofs *)
93
Lemma newbarrier_spec (P : iProp Σ) :
94
  {{{ True }}} newbarrier #() {{{ l, RET #l; recv l P  send l P }}}.
95
Proof.
96
  iIntros (Φ) "HΦ".
97
  rewrite -wp_fupd /newbarrier /=. wp_seq. wp_alloc l as "Hl".
98 99 100
  iApply ("HΦ" with ">[-]").
  iMod (saved_prop_alloc (F:=idCF) P) as (γ) "#?".
  iMod (sts_alloc (barrier_inv l P) _ N (State Low {[ γ ]}) with "[-]")
101
    as (γ') "[#? Hγ']"; eauto.
102
  { iNext. rewrite /barrier_inv /=. iFrame.
103
    iExists (const P). rewrite !big_sepS_singleton /=. eauto. }
Robbert Krebbers's avatar
Robbert Krebbers committed
104 105
  iAssert (barrier_ctx γ' l P)%I as "#?".
  { rewrite /barrier_ctx. by repeat iSplit. }
106
  iAssert (sts_ownS γ' (i_states γ) {[Change γ]}
107
     sts_ownS γ' low_states {[Send]})%I with ">[-]" as "[Hr Hs]".
Robbert Krebbers's avatar
Robbert Krebbers committed
108
  { iApply sts_ownS_op; eauto using i_states_closed, low_states_closed.
109 110
    - set_solver.
    - iApply (sts_own_weaken with "Hγ'");
Robbert Krebbers's avatar
Robbert Krebbers committed
111
        auto using sts.closed_op, i_states_closed, low_states_closed;
112
        abstract set_solver. }
113
  iModIntro. rewrite /recv /send. iSplitL "Hr".
114
  - iExists γ', P, P, γ. iFrame. auto.
115
  - auto.
116 117
Qed.

118
Lemma signal_spec l P :
119
  {{{ send l P  P }}} signal #l {{{ RET #(); True }}}.
120
Proof.
121
  rewrite /signal /send /barrier_ctx /=.
122
  iIntros (Φ) "[Hs HP] HΦ". iDestruct "Hs" as (γ) "[#Hsts Hγ]". wp_let.
123
  iMod (sts_openS (barrier_inv l P) _ _ γ with "[Hγ]")
124
    as ([p I]) "(% & [Hl Hr] & Hclose)"; eauto.
125 126
  destruct p; [|done]. wp_store.
  iSpecialize ("HΦ" with "[#]") => //. iFrame "HΦ".
127
  iMod ("Hclose" $! (State High I) ( : set token) with "[-]"); last done.
Robbert Krebbers's avatar
Robbert Krebbers committed
128
  iSplit; [iPureIntro; by eauto using signal_step|].
129
  rewrite {2}/barrier_inv /ress /=. iNext. iFrame "Hl".
130
  iDestruct "Hr" as (Ψ) "[Hr Hsp]"; iExists Ψ; iFrame "Hsp".
131
  iNext. iIntros "_"; by iApply "Hr".
132 133
Qed.

134
Lemma wait_spec l P:
135
  {{{ recv l P }}} wait #l {{{ RET #(); P }}}.
136
Proof.
Robbert Krebbers's avatar
Robbert Krebbers committed
137
  rename P into R; rewrite /recv /barrier_ctx.
138
  iIntros (Φ) "Hr HΦ"; iDestruct "Hr" as (γ P Q i) "(#Hsts & Hγ & #HQ & HQR)".
139
  iLöb as "IH". wp_rec. wp_bind (! _)%E.
140
  iMod (sts_openS (barrier_inv l P) _ _ γ with "[Hγ]")
141 142
    as ([p I]) "(% & [Hl Hr] & Hclose)"; eauto.
  wp_load. destruct p.
143
  - iMod ("Hclose" $! (State Low I) {[ Change i ]} with "[Hl Hr]") as "Hγ".
144
    { iSplit; first done. rewrite {2}/barrier_inv /=. by iFrame. }
145
    iAssert (sts_ownS γ (i_states i) {[Change i]})%I with ">[Hγ]" as "Hγ".
146
    { iApply (sts_own_weaken with "Hγ"); eauto using i_states_closed. }
147
    iModIntro. wp_if.
Ralf Jung's avatar
Ralf Jung committed
148
    iApply ("IH" with "Hγ [HQR] [HΦ]"); auto.
Robbert Krebbers's avatar
Robbert Krebbers committed
149 150
  - (* a High state: the comparison succeeds, and we perform a transition and
    return to the client *)
151
    iDestruct "Hr" as (Ψ) "[HΨ Hsp]".
152
    iDestruct (big_sepS_delete _ _ i with "Hsp") as "[#HΨi Hsp]"; first done.
153
    iAssert ( Ψ i   [ set] j  I  {[i]}, Ψ j)%I with "[HΨ]" as "[HΨ HΨ']".
Robbert Krebbers's avatar
Robbert Krebbers committed
154
    { iNext. iApply (big_sepS_delete _ _ i); first done. by iApply "HΨ". }
155
    iMod ("Hclose" $! (State High (I  {[ i ]})) ( : set token) with "[HΨ' Hl Hsp]").
156
    { iSplit; [iPureIntro; by eauto using wait_step|].
157
      rewrite {2}/barrier_inv /=. iNext. iFrame "Hl". iExists Ψ; iFrame. auto. }
158
    iPoseProof (saved_prop_agree i Q (Ψ i) with "[#]") as "Heq"; first by auto.
159
    iModIntro. wp_if.
160
    iApply "HΦ". iApply "HQR". by iRewrite "Heq".
161 162
Qed.

163
Lemma recv_split E l P1 P2 :
164
  N  E  recv l (P1  P2) ={E}= recv l P1  recv l P2.
165
Proof.
Robbert Krebbers's avatar
Robbert Krebbers committed
166
  rename P1 into R1; rename P2 into R2. rewrite {1}/recv /barrier_ctx.
167
  iIntros (?). iDestruct 1 as (γ P Q i) "(#Hsts & Hγ & #HQ & HQR)".
168
  iMod (sts_openS (barrier_inv l P) _ _ γ with "[Hγ]")
169
    as ([p I]) "(% & [Hl Hr] & Hclose)"; eauto.
170 171
  iMod (saved_prop_alloc_strong (R1: %CF (iProp Σ)) I) as (i1) "[% #Hi1]".
  iMod (saved_prop_alloc_strong (R2: %CF (iProp Σ)) (I  {[i1]}))
172
    as (i2) "[Hi2' #Hi2]"; iDestruct "Hi2'" as %Hi2.
Robbert Krebbers's avatar
Robbert Krebbers committed
173
  rewrite ->not_elem_of_union, elem_of_singleton in Hi2; destruct Hi2.
174
  iMod ("Hclose" $! (State p ({[i1; i2]}  I  {[i]}))
175 176
                   {[Change i1; Change i2 ]} with "[-]") as "Hγ".
  { iSplit; first by eauto using split_step.
177
    rewrite {2}/barrier_inv /=. iNext. iFrame "Hl".
178
    by iApply (ress_split with "HQ Hi1 Hi2 HQR"). }
179
  iAssert (sts_ownS γ (i_states i1) {[Change i1]}
180
     sts_ownS γ (i_states i2) {[Change i2]})%I with ">[-]" as "[Hγ1 Hγ2]".
181 182 183 184 185
  { iApply sts_ownS_op; eauto using i_states_closed, low_states_closed.
    - abstract set_solver.
    - iApply (sts_own_weaken with "Hγ");
        eauto using sts.closed_op, i_states_closed.
      abstract set_solver. }
186
  iModIntro; iSplitL "Hγ1"; rewrite /recv /barrier_ctx.
187 188
  - iExists γ, P, R1, i1. iFrame; auto.
  - iExists γ, P, R2, i2. iFrame; auto.
189 190
Qed.

191
Lemma recv_weaken l P1 P2 : (P1 - P2) - recv l P1 - recv l P2.
192
Proof.
193
  rewrite /recv. iIntros "HP". iDestruct 1 as (γ P Q i) "(#Hctx&Hγ&Hi&HP1)".
194
  iExists γ, P, Q, i. iFrame "Hctx Hγ Hi".
195
  iNext. iIntros "HQ". by iApply "HP"; iApply "HP1".
196
Qed.
197

198
Lemma recv_mono l P1 P2 : (P1  P2)  recv l P1  recv l P2.
199
Proof. iIntros (HP) "H". iApply (recv_weaken with "[] H"). iApply HP. Qed.
200
End proof.
Robbert Krebbers's avatar
Robbert Krebbers committed
201 202

Typeclasses Opaque barrier_ctx send recv.