Published August 28, 2020
| Version v2
Software
Open
Completeness and complexity of reasoning about call-by-value in Hoare logic (Proof Files)
Description
This archive contains a Coq formalization of parts of the completeness proof of the paper "Completeness and complexity of reasoning about call-by-value in Hoare logic".
Files
HoareCBVv2.zip
Files
(24.8 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:b80f2c3747a3311a58627de81676ea92
|
24.8 kB | Preview Download |