Skip to content
Snippets Groups Projects
Commit 1d6d9a6d authored by Ralf Jung's avatar Ralf Jung
Browse files

edit

parent 2d7ea383
No related branches found
No related tags found
No related merge requests found
...@@ -41,9 +41,6 @@ The directory structure is as follows: ...@@ -41,9 +41,6 @@ The directory structure is as follows:
`sim/refl.v`. `sim/refl.v`.
- The main invariant needed for these properties is in `sim/invariant.v`. - The main invariant needed for these properties is in `sim/invariant.v`.
* `theories/opt`: Proofs of optimizations. * `theories/opt`: Proofs of optimizations.
- For `example1` (Section 3.4 in the paper), see `opt/ex1.v` and `opt/ex1_down.v`.
- For `example2` (Section 3.6) and `example2_down` (Section 4), see `opt/ex2.v` and `opt/ex2_down.v`.
- For `example3_down` (Section 4) and `example3`, see see `opt/ex3_down.v` and `opt/ex3.v`.
For example, `theories/opt/ex1.v` provides the proof that the optimized For example, `theories/opt/ex1.v` provides the proof that the optimized
program refines the behavior of the unoptimized program, where the optimized program refines the behavior of the unoptimized program, where the optimized
...@@ -54,6 +51,10 @@ The directory structure is as follows: ...@@ -54,6 +51,10 @@ The directory structure is as follows:
The proof of (1) is in the Lemma `ex1_sim_fun`. The proof of (1) is in the Lemma `ex1_sim_fun`.
The proof of (2) is the reflexivity of our simulation relation for well-formed programs, provided in `theories/sim/refl.v`. The proof of (2) is the reflexivity of our simulation relation for well-formed programs, provided in `theories/sim/refl.v`.
- For `example1` (Section 3.4 in the paper), see `opt/ex1.v`; `example1_down` did not appear in the paper but we verified it in `opt/ex1_down.v`.
- For `example2` (Section 3.6) and `example2_down` (Section 4), see `opt/ex2.v` and `opt/ex2_down.v`, respectively.
- For `example3_down` (Section 4), see `opt/ex3_down.v`; `example3` did not appear in the paper but we verified it in `opt/ex3.v`.
### How to build ### How to build
......
0% Loading or .
You are about to add 0 people to the discussion. Proceed with caution.
Please register or to comment