-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathindex.html
193 lines (180 loc) · 12 KB
/
index.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Strict//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-strict.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<title>The Logical Essence of Well-Bracketed Control Flow (artifact) </title>
<meta http-equiv="Content-Type" content="text/html;charset=utf-8" />
<link href="folders.css" rel="stylesheet" type="text/css" />
<link href="html/coqdoc.css" rel="stylesheet" type="text/css" />
<link href="html/coqdocjs.css" rel="stylesheet" type="text/css"/>
<style>
/* The list style
-------------------------------------------------------------- */
.directory-list ul {
/* font-family: "times new roman", serif; */
margin-left: 10px;
padding-left: 20px;
border-left: 1px dashed #ddd;
}
.directory-list li {
list-style: none;
color: #888;
font-size: 17px;
/* font-style: italic; */
font-weight: normal;
}
.directory-list a {
border-bottom: 1px solid transparent;
color: rgba(31, 31, 174, 0.85);
text-decoration: none;
transition: all 0.2s ease;
}
.directory-list a:hover {
background-color: rgba(0,0,0,0.1);
border-color: #eee;
color: #000;
}
.directory-list .folder,
.directory-list .folder > a {
color: #777;
/* font-weight: bold; */
}
/* The icons
-------------------------------------------------------------- */
.directory-list li:before {
margin-right: 10px;
content: "";
height: 20px;
vertical-align: middle;
width: 20px;
background-repeat: no-repeat;
display: inline-block;
/* file icon by default */
background-image: url("data:image/svg+xml;utf8,<svg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 100 100'><path fill='lightgrey' d='M85.714,42.857V87.5c0,1.487-0.521,2.752-1.562,3.794c-1.042,1.041-2.308,1.562-3.795,1.562H19.643 c-1.488,0-2.753-0.521-3.794-1.562c-1.042-1.042-1.562-2.307-1.562-3.794v-75c0-1.487,0.521-2.752,1.562-3.794 c1.041-1.041,2.306-1.562,3.794-1.562H50V37.5c0,1.488,0.521,2.753,1.562,3.795s2.307,1.562,3.795,1.562H85.714z M85.546,35.714 H57.143V7.311c3.05,0.558,5.505,1.767,7.366,3.627l17.41,17.411C83.78,30.209,84.989,32.665,85.546,35.714z' /></svg>");
background-position: center 2px;
background-size: 60% auto;
}
.directory-list li.folder:before {
/* folder icon if folder class is specified */
background-image: url("data:image/svg+xml;utf8,<svg xmlns='http://www.w3.org/2000/svg' viewBox='0 0 100 100'><path fill='lightblue' d='M96.429,37.5v39.286c0,3.423-1.228,6.361-3.684,8.817c-2.455,2.455-5.395,3.683-8.816,3.683H16.071 c-3.423,0-6.362-1.228-8.817-3.683c-2.456-2.456-3.683-5.395-3.683-8.817V23.214c0-3.422,1.228-6.362,3.683-8.817 c2.455-2.456,5.394-3.683,8.817-3.683h17.857c3.422,0,6.362,1.228,8.817,3.683c2.455,2.455,3.683,5.395,3.683,8.817V25h37.5 c3.422,0,6.361,1.228,8.816,3.683C95.201,31.138,96.429,34.078,96.429,37.5z' /></svg>");
background-position: center top;
background-size: 75% auto;
}
</style>
</head>
<body onload="document.getElementById('content').focus()">
<div id="header">
<span class="left">
<span class="modulename"> <script> document.write(document.title) </script> </span>
</span>
<span class="button" id="toggle-proofs"></span>
<span class="right">
<a href="">Project Page</a>
<a href="html/indexpage.html"> Index </a>
<a href="html/toc.html"> Table of Contents </a>
</span>
</div>
<div id="content" tabindex="-1" onblur="document.getElementById('content').focus()">
<div id="main">
<h1>The Logical Essence of Well-Bracketed Control Flow</h1>
<h3>A Program logic on top of Iris for reasoning about well-bracketed control flow.</h3>
<hr/>
<h3>Links & Downloads:</h3>
<ul>
<li><a href="https://github.com/logsem/well-bracketed-logic">Github repository</a></li>
<li><a href="downloads/well-bracketed-logic.tar.gz">artifact [.tar.gz]</a></li>
<li><a href="downloads/wbcf_technical_appendix.pdf">accompanying technical appendix [.pdf]</a></li>
<li><a href="https://doi.org/10.5281/zenodo.10207465">Artifact on Zenodo</a></li>
</ul>
<hr/>
<h3>The structure of the Coq development:</h3>
<p> The links below open the browsable html version of the corresponding Coq file (produced by the coqdoc tool and enhanced by coqdocjs). The Coq development is organized as follows.</p>
<ul class="directory-list">
<li class="folder">
<b>F_mu_ref</b>: Unary and binary logical relations models for F_mu_ref.
<ul>
<li><a href="html/WBLogic.F_mu_ref.base.html">base.v</a>: Some basic definitions and tactics.</li>
<li class="folder"><b>binary</b>: The binary logical relations model.
<ul>
<li><a href="html/WBLogic.F_mu_ref.binary.context_refinement.html">context_refinement.v</a>: The definition of contextual refinement and some lemmas.</li>
<li class="folder"><b>examples</b>: Examples of using our binary logical relations model.
<ul>
<li><a href="html/WBLogic.F_mu_ref.binary.examples.fact.html">fact.v</a>: Equivalence of two factorial implementations.</li>
<li><a href="html/WBLogic.F_mu_ref.binary.examples.very_awkward.html">very_awkward.v</a>: The contextual equivalence of VAE.</li>
</ul>
</li>
<li><a href="html/WBLogic.F_mu_ref.binary.fundamental.html">fundamental.v</a>: The fundamental theorem of binary logical relations.</li>
<li><a href="html/WBLogic.F_mu_ref.binary.logrel.html">logrel.v</a>: The definition of binary logical relations.</li>
<li><a href="html/WBLogic.F_mu_ref.binary.rules.html">rules.v</a>: Rules for resources for tracking the specification-side program.</li>
<li><a href="html/WBLogic.F_mu_ref.binary.soundness.html">soundness.v</a>: Soundness theorem of binary logical relations.</li>
</ul>
</li>
<li><a href="html/WBLogic.F_mu_ref.lang.html">lang.v</a>: The definition (syntax & op sem) of F_mu_ref.</li>
<li><a href="html/WBLogic.F_mu_ref.typing.html">typing.v</a>: The typing rules of F_mu_ref.</li>
<li class="folder"><b>unary</b>: The unary logical relations model.
<ul>
<li class="folder"><b>examples</b>: Examples of using our unary logical relations model.
<ul>
<li><a href="html/WBLogic.F_mu_ref.unary.examples.very_awkward.html">very_awkward.v</a>: The VAE example using the unary logical relations.</li>
</ul>
</li>
<li><a href="html/WBLogic.F_mu_ref.unary.fundamental.html">fundamental.v</a>: The fundamental theorem of the unary logical relations model.</li>
<li><a href="html/WBLogic.F_mu_ref.unary.logrel.html">logrel.v</a>: The definition of the unary logical relations.</li>
<li><a href="html/WBLogic.F_mu_ref.unary.soundness.html">soundness.v</a>: Soundness of the unary logical relations model.</li>
</ul>
</li>
<li><a href="html/WBLogic.F_mu_ref.wp_rules.html">wp_rules.v</a>: The (well-bracketed) weakest precondition rules for F_mu_ref.</li>
</ul>
</li>
<li class="folder"><b>heap_lang</b>: A copy of the necessary parts of heap lang from the Iris development.
<ul>
<li><a href="html/WBLogic.heap_lang.adequacy.html">adequacy.v</a>: The adequacy theorem.</li>
<li><a href="html/WBLogic.heap_lang.derived_laws.html">derived_laws.v</a>: Derived rules for well-bracketed weakest preconditions.</li>
<li><a href="html/WBLogic.heap_lang.primitive_laws.html">primitive_laws.v</a>: Primitive rules for weakest preconditions.</li>
<li><a href="html/WBLogic.heap_lang.proofmode.html">proofmode.v</a>: Lemmas and tactics for proofmode support for heap_lang programs.</li>
</ul>
</li>
<li class="folder"><b>heap_lang_examples</b>: Examples on top of heap lang.
<ul>
<li><a href="html/WBLogic.heap_lang_examples.awkward.html">awkward.v</a>: The awkward example.</li>
<li class="folder"><b>sts</b>: Examples using the STS encoding.
<ul><li><a href="html/WBLogic.heap_lang_examples.sts.very_awkward.html">very_awkward.v</a>: The STS version of VAE.</li></ul>
</li>
<li><a href="html/WBLogic.heap_lang_examples.very_awkward.html">very_awkward.v</a>: VAE proven well-bracketed in heap lang.</li>
</ul>
</li>
<li class="folder"><b>heap_lang_trace</b>: The version of heap lang with intensional traces.
<ul>
<li><a href="html/WBLogic.heap_lang_trace.adequacy.html">adequacy.v</a>: The adequacy theorem.</li>
<li><a href="html/WBLogic.heap_lang_trace.class_instances.html">class_instances.v</a>: Type classes for Iris's proof mode.</li>
<li><a href="html/WBLogic.heap_lang_trace.derived_laws.html">derived_laws.v</a>: Derived rules for well-bracketed weakest preconditions.</li>
<li><a href="html/WBLogic.heap_lang_trace.lang.html">lang.v</a>: Definition of the language heaplang with added trace primitives.</li>
<li><a href="html/WBLogic.heap_lang_trace.notation.html">notation.v</a>: Useful notations for writing programs.</li>
<li><a href="html/WBLogic.heap_lang_trace.primitive_laws.html">primitive_laws.v</a>: Primitive rules for weakest preconditions.</li>
<li><a href="html/WBLogic.heap_lang_trace.proofmode.html">proofmode.v</a>: Lemmas and tactics for proofmode support for heap_lang programs.</li>
<li><a href="html/WBLogic.heap_lang_trace.tactics.html">tactics.v</a>: Supporting tactics for defining proofmode tactics.</li>
<li><a href="html/WBLogic.heap_lang_trace.trace_resources.html">trace_resources.v</a>: Iris resources for reasoning about program traces.</li>
</ul>
</li>
<li class="folder"><b>heap_lang_trace_examples</b>: Examples using intensional trace properties in heap lang.
<ul>
<li><a href="html/WBLogic.heap_lang_trace_examples.sequential_trace_alt.html">sequential_trace_alt.v</a>: The definition of well-bracketed trace of calls and returns.</li>
<li><a href="html/WBLogic.heap_lang_trace_examples.very_awkward.html">very_awkward.v</a>: The VAE example proven to produce well-bracketed traces.</li>
</ul>
</li>
<li><a href="html/WBLogic.oneshot.html">oneshot.v</a>: The definition of the one-shot resource algebra</li>
<li><a href="html/WBLogic.persistent_pred.html">persistent_pred.v</a>: Definition of persistent predicates used in logical relations.</li>
<li class="folder"><b>program_logic</b>: The well-bracketed program logic.
<ul>
<li><a href="html/WBLogic.program_logic.adequacy.html">adequacy.v</a>: The adequacy theorem of the well-bracketed program logic.</li>
<li><a href="html/WBLogic.program_logic.ghost_stacks.html">ghost_stacks.v</a>: The theory of ghost stacks including resource algebras.</li>
<li class="folder"><b>lib</b>: Developments on top of the well-bracketed program logic.
<ul><li><a href="html/WBLogic.program_logic.lib.sts.html">sts.v</a>: The encoding of STSs using ghost stacks.</li></ul>
</li>
<li><a href="html/WBLogic.program_logic.lifting.html">lifting.v</a>: A couple of useful lemmas.</li>
<li><a href="html/WBLogic.program_logic.weakestpre.html">weakestpre.v</a>: Definition of well-bracketed weakest preconditions.</li>
</ul>
</li>
</ul>
</div>
</body>
</html>