Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
Iris
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Package Registry
Model registry
Operate
Terraform modules
Monitor
Service Desk
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Terms and privacy
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
Simcha van Collem
Iris
Commits
cf2cd8ee
Commit
cf2cd8ee
authored
9 years ago
by
Ralf Jung
Browse files
Options
Downloads
Patches
Plain Diff
more cancelling in barrier
parent
a2e945d9
No related branches found
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
barrier/barrier.v
+16
-19
16 additions, 19 deletions
barrier/barrier.v
with
16 additions
and
19 deletions
barrier/barrier.v
+
16
−
19
View file @
cf2cd8ee
...
@@ -260,9 +260,9 @@ Section proof.
...
@@ -260,9 +260,9 @@ Section proof.
rewrite
pvs_frame_l
.
apply
pvs_strip_pvs
.
rewrite
sep_exist_l
.
rewrite
pvs_frame_l
.
apply
pvs_strip_pvs
.
rewrite
sep_exist_l
.
apply
exist_elim
=>
i
.
apply
exist_elim
=>
i
.
trans
(
pvs
⊤
⊤
(
heap_ctx
heapN
★
▷
(
barrier_inv
l
P
(
State
Low
{[
i
]}))
★
saved_prop_own
i
P
))
.
trans
(
pvs
⊤
⊤
(
heap_ctx
heapN
★
▷
(
barrier_inv
l
P
(
State
Low
{[
i
]}))
★
saved_prop_own
i
P
))
.
-
rewrite
-
pvs_intro
.
rewrite
[(_
★
heap_ctx
_)
%
I
]
comm
-!
assoc
.
apply
sep_mono_r
.
-
rewrite
-
pvs_intro
.
cancel
(
heap_ctx
heapN
)
.
rewrite
{
1
}[
saved_prop_own
_
_]
always_sep_dup
!
assoc
.
apply
sep_mono_l
.
rewrite
{
1
}[
saved_prop_own
_
_]
always_sep_dup
.
cancel
(
saved_prop_own
i
P
)
.
rewrite
/
barrier_inv
/
waiting
-
later_intro
.
apply
sep_mono_r
.
rewrite
/
barrier_inv
/
waiting
-
later_intro
.
cancel
(
l
↦
'
0
)
%
I
.
rewrite
-
(
exist_intro
(
const
P
))
/=.
rewrite
-
[
saved_prop_own
_
_](
left_id
True
%
I
(
★
)
%
I
)
.
rewrite
-
(
exist_intro
(
const
P
))
/=.
rewrite
-
[
saved_prop_own
_
_](
left_id
True
%
I
(
★
)
%
I
)
.
apply
sep_mono
.
apply
sep_mono
.
+
rewrite
-
later_intro
.
apply
wand_intro_l
.
rewrite
right_id
.
+
rewrite
-
later_intro
.
apply
wand_intro_l
.
rewrite
right_id
.
...
@@ -278,6 +278,7 @@ Section proof.
...
@@ -278,6 +278,7 @@ Section proof.
(* This is even more annoying than usually, since rewrite sometimes unfolds stuff... *)
(* This is even more annoying than usually, since rewrite sometimes unfolds stuff... *)
rewrite
[
barrier_ctx
_
_
_]
lock
!
assoc
[(_
★
locked
_)
%
I
]
comm
!
assoc
-
lock
.
rewrite
[
barrier_ctx
_
_
_]
lock
!
assoc
[(_
★
locked
_)
%
I
]
comm
!
assoc
-
lock
.
rewrite
-
always_sep_dup
.
rewrite
-
always_sep_dup
.
(* TODO: This is cancelling below a pvs. *)
rewrite
[
barrier_ctx
_
_
_]
lock
always_and_sep_l
-!
assoc
assoc
-
lock
.
rewrite
[
barrier_ctx
_
_
_]
lock
always_and_sep_l
-!
assoc
assoc
-
lock
.
rewrite
-
pvs_frame_l
.
rewrite
/
barrier_ctx
const_equiv
//
left_id
.
apply
sep_mono_r
.
rewrite
-
pvs_frame_l
.
rewrite
/
barrier_ctx
const_equiv
//
left_id
.
apply
sep_mono_r
.
rewrite
[(
saved_prop_own
_
_
★
_)
%
I
]
comm
!
assoc
.
rewrite
-
pvs_frame_r
.
rewrite
[(
saved_prop_own
_
_
★
_)
%
I
]
comm
!
assoc
.
rewrite
-
pvs_frame_r
.
...
@@ -306,8 +307,8 @@ Section proof.
...
@@ -306,8 +307,8 @@ Section proof.
apply
forall_intro
=>
-
[
p
I
]
.
apply
wand_intro_l
.
rewrite
-!
assoc
.
apply
forall_intro
=>
-
[
p
I
]
.
apply
wand_intro_l
.
rewrite
-!
assoc
.
apply
const_elim_sep_l
=>
Hs
.
destruct
p
;
last
done
.
apply
const_elim_sep_l
=>
Hs
.
destruct
p
;
last
done
.
rewrite
{
1
}
/
barrier_inv
=>
/=
{
Hs
}
.
rewrite
later_sep
.
rewrite
{
1
}
/
barrier_inv
=>
/=
{
Hs
}
.
rewrite
later_sep
.
eapply
wp_store
;
eauto
with
I
ndisj
.
eapply
wp_store
with
(
v'
:=
'
0
)
;
eauto
with
I
ndisj
.
rewrite
-!
assoc
.
apply
sep_mono_r
.
u_strip_later
.
u_strip_later
.
cancel
(
l
↦
'
0
)
%
I
.
apply
wand_intro_l
.
rewrite
-
(
exist_intro
(
State
High
I
))
.
apply
wand_intro_l
.
rewrite
-
(
exist_intro
(
State
High
I
))
.
rewrite
-
(
exist_intro
∅
)
.
rewrite
const_equiv
/=
;
last
by
eauto
with
sts
.
rewrite
-
(
exist_intro
∅
)
.
rewrite
const_equiv
/=
;
last
by
eauto
with
sts
.
rewrite
left_id
-
later_intro
{
2
}
/
barrier_inv
-!
assoc
.
apply
sep_mono_r
.
rewrite
left_id
-
later_intro
{
2
}
/
barrier_inv
-!
assoc
.
apply
sep_mono_r
.
...
@@ -423,14 +424,12 @@ Section proof.
...
@@ -423,14 +424,12 @@ Section proof.
apply
sep_mono
.
apply
sep_mono
.
*
rewrite
-
sts_ownS_op
;
by
eauto
using
sts_own_weaken
with
sts
.
*
rewrite
-
sts_ownS_op
;
by
eauto
using
sts_own_weaken
with
sts
.
*
rewrite
const_equiv
//
!
left_id
.
*
rewrite
const_equiv
//
!
left_id
.
rewrite
{
1
}[
heap_ctx
_]
always_sep_dup
!
assoc
[(_
★
heap_ctx
_)
%
I
]
comm
-!
assoc
.
apply
sep_mono_r
.
rewrite
{
1
}[
heap_ctx
_]
always_sep_dup
{
1
}[
sts_ctx
_
_
_]
always_sep_dup
.
rewrite
!
assoc
!
[(_
★
heap_ctx
_)
%
I
]
comm
-!
assoc
.
apply
sep_mono_r
.
do
2
cancel
(
heap_ctx
heapN
)
.
do
2
cancel
(
sts_ctx
γ
N
(
barrier_inv
l
P
))
.
rewrite
{
1
}[
sts_ctx
_
_
_]
always_sep_dup
!
assoc
[(_
★
sts_ctx
_
_
_)
%
I
]
comm
-!
assoc
.
apply
sep_mono_r
.
cancel
(
saved_prop_own
i1
R1
)
.
cancel
(
saved_prop_own
i2
R2
)
.
rewrite
!
assoc
!
[(_
★
sts_ctx
_
_
_)
%
I
]
comm
-!
assoc
.
apply
sep_mono_r
.
apply
sep_intro_True_l
.
rewrite
comm
.
apply
sep_mono_r
.
apply
sep_intro_True_l
.
{
rewrite
-
later_intro
.
apply
wand_intro_l
.
by
rewrite
right_id
.
}
apply
sep_intro_True_r
;
first
done
.
{
rewrite
-
later_intro
.
apply
wand_intro_l
.
by
rewrite
right_id
.
}
{
rewrite
-
later_intro
.
apply
wand_intro_l
.
by
rewrite
right_id
.
}
rewrite
-
later_intro
.
apply
wand_intro_l
.
by
rewrite
right_id
.
(* Case II: High state. TODO: Lots of this script is just copy-n-paste of the previous one.
(* Case II: High state. TODO: Lots of this script is just copy-n-paste of the previous one.
Most of that is because the goals are fairly similar in structure, and the proof scripts
Most of that is because the goals are fairly similar in structure, and the proof scripts
are mostly concerned with manually managaing the structure (assoc, comm, dup) of
are mostly concerned with manually managaing the structure (assoc, comm, dup) of
...
@@ -456,14 +455,12 @@ Section proof.
...
@@ -456,14 +455,12 @@ Section proof.
apply
sep_mono
.
apply
sep_mono
.
*
rewrite
-
sts_ownS_op
;
by
eauto
using
sts_own_weaken
with
sts
.
*
rewrite
-
sts_ownS_op
;
by
eauto
using
sts_own_weaken
with
sts
.
*
rewrite
const_equiv
//
!
left_id
.
*
rewrite
const_equiv
//
!
left_id
.
rewrite
{
1
}[
heap_ctx
_]
always_sep_dup
!
assoc
[(_
★
heap_ctx
_)
%
I
]
comm
-!
assoc
.
apply
sep_mono_r
.
rewrite
{
1
}[
heap_ctx
_]
always_sep_dup
{
1
}[
sts_ctx
_
_
_]
always_sep_dup
.
rewrite
!
assoc
!
[(_
★
heap_ctx
_)
%
I
]
comm
-!
assoc
.
apply
sep_mono_r
.
do
2
cancel
(
heap_ctx
heapN
)
.
do
2
cancel
(
sts_ctx
γ
N
(
barrier_inv
l
P
))
.
rewrite
{
1
}[
sts_ctx
_
_
_]
always_sep_dup
!
assoc
[(_
★
sts_ctx
_
_
_)
%
I
]
comm
-!
assoc
.
apply
sep_mono_r
.
cancel
(
saved_prop_own
i1
R1
)
.
cancel
(
saved_prop_own
i2
R2
)
.
rewrite
!
assoc
!
[(_
★
sts_ctx
_
_
_)
%
I
]
comm
-!
assoc
.
apply
sep_mono_r
.
apply
sep_intro_True_l
.
rewrite
comm
.
apply
sep_mono_r
.
apply
sep_intro_True_l
.
{
rewrite
-
later_intro
.
apply
wand_intro_l
.
by
rewrite
right_id
.
}
apply
sep_intro_True_r
;
first
done
.
{
rewrite
-
later_intro
.
apply
wand_intro_l
.
by
rewrite
right_id
.
}
{
rewrite
-
later_intro
.
apply
wand_intro_l
.
by
rewrite
right_id
.
}
rewrite
-
later_intro
.
apply
wand_intro_l
.
by
rewrite
right_id
.
Qed
.
Qed
.
Lemma
recv_strengthen
l
P1
P2
:
Lemma
recv_strengthen
l
P1
P2
:
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment