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
Pierre Roux
Iris
Commits
b8d083f2
Commit
b8d083f2
authored
5 years ago
by
Ralf Jung
Browse files
Options
Downloads
Patches
Plain Diff
explain why the open inv-creation does not imply the other variants
parent
b03f7081
No related branches found
No related tags found
No related merge requests found
Changes
2
Hide whitespace changes
Inline
Side-by-side
Showing
2 changed files
theories/base_logic/lib/cancelable_invariants.v
+3
-2
3 additions, 2 deletions
theories/base_logic/lib/cancelable_invariants.v
theories/base_logic/lib/invariants.v
+1
-0
1 addition, 0 deletions
theories/base_logic/lib/invariants.v
with
4 additions
and
2 deletions
theories/base_logic/lib/cancelable_invariants.v
+
3
−
2
View file @
b8d083f2
...
...
@@ -62,7 +62,7 @@ Section proofs.
(*** Allocation rules. *)
(** The "strong" variants permit any infinite [I], and choosing [P] is delayed
until after [γ] was chosen.
*)
until after [γ] was chosen.*)
Lemma
cinv_alloc_strong
(
I
:
gname
→
Prop
)
E
N
:
pred_infinite
I
→
(|
=
{
E
}=>
∃
γ
,
⌜
I
γ
⌝
∗
cinv_own
γ
1
∗
∀
P
,
▷
P
=
{
E
}
=∗
cinv
N
γ
P
)
%
I
.
...
...
@@ -73,7 +73,8 @@ Section proofs.
Qed
.
(** The "open" variants create the invariant in the open state, and delay
having to prove [P]. *)
having to prove [P].
These do not imply the other variants because of the extra assumption [↑N ⊆ E]. *)
Lemma
cinv_alloc_strong_open
(
I
:
gname
→
Prop
)
E
N
:
pred_infinite
I
→
↑
N
⊆
E
→
...
...
This diff is collapsed.
Click to expand it.
theories/base_logic/lib/invariants.v
+
1
−
0
View file @
b8d083f2
...
...
@@ -56,6 +56,7 @@ Section inv.
do
2
iModIntro
.
iExists
i
.
auto
.
Qed
.
(* This does not imply [own_inv_alloc] due to the extra assumption [↑N ⊆ E]. *)
Lemma
own_inv_alloc_open
N
E
P
:
↑
N
⊆
E
→
(|
=
{
E
,
E
∖↑
N
}=>
own_inv
N
P
∗
(
▷
P
=
{
E
∖↑
N
,
E
}
=∗
True
))
%
I
.
Proof
.
...
...
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