Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Support
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
I
Iris
Project overview
Project overview
Details
Activity
Releases
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Issues
90
Issues
90
List
Boards
Labels
Milestones
Merge Requests
8
Merge Requests
8
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Analytics
Analytics
CI / CD
Repository
Value Stream
Wiki
Wiki
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
Iris
Iris
Commits
c7b8538e
Commit
c7b8538e
authored
Oct 07, 2014
by
Derek Dreyer
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
added rationale for our mechanization to README file
parent
34467c6d
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
23 additions
and
1 deletion
+23
-1
README.txt
README.txt
+23
-1
No files found.
README.txt
View file @
c7b8538e
...
...
@@ -19,9 +19,30 @@ CONTENTS
Our artifact is a Coq formalization of the model of our Iris logic,
together with a proof of adequacy (establishing that the model is
faithful wrt the operational semantics)
,
and a proof of soundness of
faithful wrt the operational semantics) and a proof of soundness of
the primitive rules of the logic wrt the model.
NOTE: We have just mechanized the *soundness* of the *primitive*
rules of Iris in Coq. We have not mechanized the proofs of derived
rules (i.e. those derivable from the primitive rules), nor have we
mechanized the case study or other examples that are proven within
the logic. Proof outlines for the latter are given in the appendix
that accompanied the POPL submission, and will be fleshed out even
further for the final version of the appendix.
The reason we focused on the primitive rules is that those are the
rules whose soundness is proven by direct appeal to the semantic
model of Iris. For space reasons, we did not want to present the
semantic model of Iris in any detail in the paper, but we still
wanted to give the reader confidence in the results of the paper.
With our Coq mechanization in hand, the reader can safely ignore the
semantic model and instead focus on how to *use* the primitive rules
of the logic (to derive more sophisticated rules or prove
interesting examples).
Mechanizing Iris proofs is a very interesting and important
direction for future work, but it is beyond the scope of the paper.
The folder is organized as follows:
...
...
@@ -90,3 +111,4 @@ OVERVIEW OF LEMMAS
Fork htFork
The main adequacy result is expressed by Theorem soundness_obs.
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment