2020-08-28
Completeness and complexity of reasoning about call-by-value in Hoare logic (Proof Files)
Publication
Publication
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".
| Additional Metadata | |
|---|---|
| Organisation | Computer Security |
|
Hiep, H.-D. (2020). Completeness and complexity of reasoning about call-by-value in Hoare logic (Proof Files). |
|
| Additional Files | |
|---|---|
| View at Zenodo | |
