Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
I
iris-coq
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Model registry
Operate
Environments
Monitor
Incidents
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
Marianna Rapoport
iris-coq
Commits
391e52d7
Commit
391e52d7
authored
7 years ago
by
Robbert Krebbers
Browse files
Options
Downloads
Patches
Plain Diff
Fix previous commit.
parent
ff61f8a8
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/namespaces.v
+1
-1
1 addition, 1 deletion
theories/base_logic/lib/namespaces.v
theories/heap_lang/lib/barrier/protocol.v
+1
-1
1 addition, 1 deletion
theories/heap_lang/lib/barrier/protocol.v
with
2 additions
and
2 deletions
theories/base_logic/lib/namespaces.v
+
1
−
1
View file @
391e52d7
...
...
@@ -35,7 +35,7 @@ Section namespace.
Global
Instance
ndot_inj
:
Inj2
(
=
)
(
=
)
(
=
)
(
@
ndot
A
_
_)
.
Proof
.
intros
N1
x1
N2
x2
;
rewrite
!
ndot_eq
=>
?;
by
simplify_eq
.
Qed
.
Lemma
nclose_nroot
:
↑
nroot
=
⊤
.
Lemma
nclose_nroot
:
↑
nroot
=
(
⊤
:
coPset
)
.
Proof
.
rewrite
nclose_eq
.
by
apply
(
sig_eq_pi
_)
.
Qed
.
Lemma
encode_nclose
N
:
encode
N
∈
(
↑
N
:
coPset
)
.
Proof
.
...
...
This diff is collapsed.
Click to expand it.
theories/heap_lang/lib/barrier/protocol.v
+
1
−
1
View file @
391e52d7
...
...
@@ -77,7 +77,7 @@ Proof.
-
destruct
p
;
set_solver
.
-
apply
elem_of_equiv
=>
/=
-
[
j
|];
last
set_solver
.
set_unfold
;
rewrite
!
(
inj_iff
Change
)
.
assert
(
Change
j
∈
match
p
with
Low
=>
∅
|
High
=>
{[
Send
]}
end
↔
False
)
assert
(
Change
j
∈
match
p
with
Low
=>
∅
:
set
token
|
High
=>
{[
Send
]}
end
↔
False
)
as
->
by
(
destruct
p
;
set_solver
)
.
destruct
(
decide
(
i1
=
j
))
as
[
->
|];
first
naive_solver
.
destruct
(
decide
(
i2
=
j
))
as
[
->
|];
first
naive_solver
.
...
...
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