Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
S
storebuffer
Manage
Activity
Members
Code
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Deploy
Model registry
Analyze
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
tacoq
storebuffer
Commits
b5678f75
Commit
b5678f75
authored
2 years ago
by
Alban Gruin
Browse files
Options
Downloads
Patches
Plain Diff
correct_store_buffer: rename lemmas for clarity
Signed-off-by:
Alban Gruin
<
alban.gruin@irit.fr
>
parent
9cfc8c03
Branches
Branches containing commit
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
src/correct_store_buffer.v
+9
-6
9 additions, 6 deletions
src/correct_store_buffer.v
with
9 additions
and
6 deletions
src/correct_store_buffer.v
+
9
−
6
View file @
b5678f75
...
...
@@ -235,7 +235,7 @@ Section monotonicity.
-
auto
.
Qed
.
Lemma
unmoved_
can_advance
:
Lemma
unmoved_
is_monotonic
:
forall
n
,
e
=
(
opc
,
(
st
,
n
))
->
e
=
e
'
->
compare_two
(
List
.
nth_error
tc
i
)
(
List
.
nth_error
tc
'
i
)
=
true
.
Proof
.
...
...
@@ -263,7 +263,7 @@ Section monotonicity.
Variable
st
'
:
stage
.
Lemma
moved_no_lat_is_
lower
:
Lemma
moved_no_lat_is_
monotonic
:
e
=
(
opc
,
(
st
,
0
))
->
e
'
=
(
opc
,
(
st
'
,
0
))
->
e
<>
e
'
->
state_leb
(
st
,
0
)
(
st
'
,
0
)
=
true
->
compare_two
(
List
.
nth_error
tc
i
)
(
List
.
nth_error
tc
'
i
)
=
true
.
...
...
@@ -311,7 +311,7 @@ Section monotonicity.
Hypothesis
HvalidStLat
:
forall
(
e
:
instr_kind
)
st
n
,
e
=
(
Store
,
(
st
,
n
))
->
n
=
0.
Hypothesis
HvalidLdLat
:
forall
(
e
:
instr_kind
)
st
n
dlat
,
e
=
(
Load
dlat
,
(
st
,
n
))
->
0
<>
n
->
st
=
Lu
/
\
n
<=
dlat
.
Lemma
moved_lat_is_
lower
:
Lemma
moved_lat_is_
monotonic
:
forall
n
n
'
,
e
=
(
opc
,
(
st
,
n
))
->
e
'
=
(
opc
,
(
st
'
,
n
'
))
->
e
<>
e
'
->
state_leb
(
st
,
n
)
(
st
'
,
n
'
)
=
true
->
compare_two
(
List
.
nth_error
tc
i
)
(
List
.
nth_error
tc
'
i
)
=
true
.
...
...
@@ -324,7 +324,7 @@ Section monotonicity.
destruct
n
,
n
'
;
[
(
*
n
and
n
'
are
=
0.
We
have
a
lemma
for
that
.
*
)
now
apply
moved_no_lat_is_
lower
|
now
apply
moved_no_lat_is_
monotonic
|
(
*
Other
cases
:
rewrite
the
goal
to
make
cycle
appear
.
*
)
rewrite
Htc
,
Htc
'
,
Ht
,
Ht
'
;
unfold
cycle
;
...
...
@@ -374,8 +374,11 @@ Section monotonicity.
intros
n
n
'
He
He
'
Hsl
.
pose
proof
(
instr_kind_is_comparable
e
e
'
)
as
Heqd
.
(
*
e
=
e
'
or
e
<>
e
'
.
*
)
destruct
Heqd
as
[
Heq
|
Hdiff
].
-
now
apply
(
unmoved_can_advance
n
).
-
now
apply
(
moved_lat_is_lower
n
n
'
).
-
(
*
If
e
=
e
'
,
we
have
a
lemma
for
this
.
*
)
now
apply
(
unmoved_is_monotonic
n
).
-
(
*
If
e
<>
e
'
,
we
have
a
lemma
for
this
.
*
)
now
apply
(
moved_lat_is_monotonic
n
n
'
).
Qed
.
End
monotonicity
.
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