Library zoo_std.queue_3
Require Import zoo.prelude.
Require Import zoo.base.
Require Import zoo_std.option.
Require Export zoo_std.queue_3__code.
Require Import zoo_std.queue_3__types.
Require Import zoo.options.
Implicit Type b : bool.
Implicit Type l : location.
Implicit Type front back : nat.
Implicit Type v t : val.
Implicit Type o : option val.
#[local] Definition min_capacity :=
val۰to_nat' queue_3٠min_capacity.
#[local] Lemma queue_3٠min_capacityーunfold :
queue_3٠min_capacity = #min_capacity.
Opaque queue_3٠min_capacity.
Opaque min_capacity.
Section zoo۰G.
Context `{zoo۰G : !ZooG Σ}.
#[local] Definition model' t vs extra : iProp Σ :=
∃ l data cap front back,
⌜t = #l⌝ ∗
l.[data] ↦ data ∗
l.[front] ↦ #front ∗
l.[back] ↦ #back ∗
array۰cslice data cap front (DfracOwn 1) vs ∗
array۰cslice data cap back (DfracOwn 1) (replicate extra ()%V) ∗
⌜back = (front + length vs)%nat⌝ ∗
⌜cap = (length vs + extra)%nat⌝ ∗
⌜cap ≠ 0⌝.
#[local] Instance : CustomIpat "model'" :=
" ( %l & %data & %cap & %front & %back & -> & Hl_data & Hl_front & Hl_back & Hvs & Hextra & %Hback & %Hcap & % ) ".
Definition queue_3۰model t vs : iProp Σ :=
∃ extra,
model' t vs extra.
#[local] Instance : CustomIpat "model" :=
" ( %extra & {{lazy}Hmodel;(:model')} ) ".
#[global] Instance queue_3۰modelーtimeless t vs :
Timeless (queue_3۰model t vs).
Lemma queue_3۰modelーexclusive t vs1 vs2 :
queue_3۰model t vs1 -∗
queue_3۰model t vs2 -∗
False.
Lemma queue_3٠createーspec :
{{{
True
}}}
queue_3٠create ()
{{{
t
, RET t;
queue_3۰model t []
}}}.
Lemma queue_3٠sizeーspec t vs :
{{{
queue_3۰model t vs
}}}
queue_3٠size t
{{{
RET #(length vs);
queue_3۰model t vs
}}}.
Lemma queue_3٠is_emptyーspec t vs :
{{{
queue_3۰model t vs
}}}
queue_3٠is_empty t
{{{
RET #(bool_decide (vs = []%list));
queue_3۰model t vs
}}}.
Lemma queue_3٠unsafe_getーspec {t vs i} v :
(0 ≤ i)%Z →
vs !! ₊i = Some v →
{{{
queue_3۰model t vs
}}}
queue_3٠unsafe_get t #i
{{{
RET v;
queue_3۰model t vs
}}}.
Lemma queue_3٠unsafe_setーspec t vs i v :
(0 ≤ i < length vs)%Z →
{{{
queue_3۰model t vs
}}}
queue_3٠unsafe_set t #i v
{{{
RET ();
queue_3۰model t (<[₊i := v]> vs)
}}}.
#[local] Lemma queue_3٠next_capacityーspec n :
(0 ≤ n)%Z →
{{{
True
}}}
queue_3٠next_capacity #n
{{{
m
, RET #m;
⌜n ≤ m⌝%Z
}}}.
#[local] Lemma queue_3٠growーspec t vs extra :
{{{
model' t vs extra
}}}
queue_3٠grow t
{{{
extra
, RET ();
⌜0 < extra⌝ ∗
model' t vs extra
}}}.
Lemma queue_3٠pushーspec t vs v :
{{{
queue_3۰model t vs
}}}
queue_3٠push t v
{{{
RET ();
queue_3۰model t (vs ++ [v])
}}}.
#[local] Lemma queue_3٠shrinkーspec t vs :
{{{
queue_3۰model t vs
}}}
queue_3٠shrink t
{{{
RET ();
queue_3۰model t vs
}}}.
Lemma queue_3٠pop_frontーspec t vs :
{{{
queue_3۰model t vs
}}}
queue_3٠pop_front t
{{{
RET head vs;
queue_3۰model t (tail vs)
}}}.
Lemma queue_3٠pop_backーspec t vs :
{{{
queue_3۰model t vs
}}}
queue_3٠pop_back t
{{{
o
, RET o;
match o with
| None ⇒
⌜vs = []⌝ ∗
queue_3۰model t []
| Some v ⇒
∃ vs',
⌜vs = vs' ++ [v]⌝ ∗
queue_3۰model t vs'
end
}}}.
End zoo۰G.
Require zoo_std.queue_3__opaque.
#[global] Opaque queue_3۰model.
Require Import zoo.base.
Require Import zoo_std.option.
Require Export zoo_std.queue_3__code.
Require Import zoo_std.queue_3__types.
Require Import zoo.options.
Implicit Type b : bool.
Implicit Type l : location.
Implicit Type front back : nat.
Implicit Type v t : val.
Implicit Type o : option val.
#[local] Definition min_capacity :=
val۰to_nat' queue_3٠min_capacity.
#[local] Lemma queue_3٠min_capacityーunfold :
queue_3٠min_capacity = #min_capacity.
Opaque queue_3٠min_capacity.
Opaque min_capacity.
Section zoo۰G.
Context `{zoo۰G : !ZooG Σ}.
#[local] Definition model' t vs extra : iProp Σ :=
∃ l data cap front back,
⌜t = #l⌝ ∗
l.[data] ↦ data ∗
l.[front] ↦ #front ∗
l.[back] ↦ #back ∗
array۰cslice data cap front (DfracOwn 1) vs ∗
array۰cslice data cap back (DfracOwn 1) (replicate extra ()%V) ∗
⌜back = (front + length vs)%nat⌝ ∗
⌜cap = (length vs + extra)%nat⌝ ∗
⌜cap ≠ 0⌝.
#[local] Instance : CustomIpat "model'" :=
" ( %l & %data & %cap & %front & %back & -> & Hl_data & Hl_front & Hl_back & Hvs & Hextra & %Hback & %Hcap & % ) ".
Definition queue_3۰model t vs : iProp Σ :=
∃ extra,
model' t vs extra.
#[local] Instance : CustomIpat "model" :=
" ( %extra & {{lazy}Hmodel;(:model')} ) ".
#[global] Instance queue_3۰modelーtimeless t vs :
Timeless (queue_3۰model t vs).
Lemma queue_3۰modelーexclusive t vs1 vs2 :
queue_3۰model t vs1 -∗
queue_3۰model t vs2 -∗
False.
Lemma queue_3٠createーspec :
{{{
True
}}}
queue_3٠create ()
{{{
t
, RET t;
queue_3۰model t []
}}}.
Lemma queue_3٠sizeーspec t vs :
{{{
queue_3۰model t vs
}}}
queue_3٠size t
{{{
RET #(length vs);
queue_3۰model t vs
}}}.
Lemma queue_3٠is_emptyーspec t vs :
{{{
queue_3۰model t vs
}}}
queue_3٠is_empty t
{{{
RET #(bool_decide (vs = []%list));
queue_3۰model t vs
}}}.
Lemma queue_3٠unsafe_getーspec {t vs i} v :
(0 ≤ i)%Z →
vs !! ₊i = Some v →
{{{
queue_3۰model t vs
}}}
queue_3٠unsafe_get t #i
{{{
RET v;
queue_3۰model t vs
}}}.
Lemma queue_3٠unsafe_setーspec t vs i v :
(0 ≤ i < length vs)%Z →
{{{
queue_3۰model t vs
}}}
queue_3٠unsafe_set t #i v
{{{
RET ();
queue_3۰model t (<[₊i := v]> vs)
}}}.
#[local] Lemma queue_3٠next_capacityーspec n :
(0 ≤ n)%Z →
{{{
True
}}}
queue_3٠next_capacity #n
{{{
m
, RET #m;
⌜n ≤ m⌝%Z
}}}.
#[local] Lemma queue_3٠growーspec t vs extra :
{{{
model' t vs extra
}}}
queue_3٠grow t
{{{
extra
, RET ();
⌜0 < extra⌝ ∗
model' t vs extra
}}}.
Lemma queue_3٠pushーspec t vs v :
{{{
queue_3۰model t vs
}}}
queue_3٠push t v
{{{
RET ();
queue_3۰model t (vs ++ [v])
}}}.
#[local] Lemma queue_3٠shrinkーspec t vs :
{{{
queue_3۰model t vs
}}}
queue_3٠shrink t
{{{
RET ();
queue_3۰model t vs
}}}.
Lemma queue_3٠pop_frontーspec t vs :
{{{
queue_3۰model t vs
}}}
queue_3٠pop_front t
{{{
RET head vs;
queue_3۰model t (tail vs)
}}}.
Lemma queue_3٠pop_backーspec t vs :
{{{
queue_3۰model t vs
}}}
queue_3٠pop_back t
{{{
o
, RET o;
match o with
| None ⇒
⌜vs = []⌝ ∗
queue_3۰model t []
| Some v ⇒
∃ vs',
⌜vs = vs' ++ [v]⌝ ∗
queue_3۰model t vs'
end
}}}.
End zoo۰G.
Require zoo_std.queue_3__opaque.
#[global] Opaque queue_3۰model.