Software Open Access

Coq formalization and soundness proof for an input/output verification approach

Penninckx, Willem; Jacobs, Bart

This is a Coq formalization and soundness proof for an input/output verification approach. The proof rules do not support verifying nonterminating executions, although the step semantics support nonterminating runs.

Coq version used: 8.4pl4

 

This work was supported by: * EU FP7 FET-Open project ADVENT under grant number 308830, * Research Fund KU Leuven under grant agreement OT/13/065 (project VERIFAST) * the European Union's Horizon 2020 research and innovation programme under grant agreement No 731453 (project VESSEDIA).
Files (18.7 kB)
Name Size
io-coq-2016-12-02.tar.xz
md5:099c0c5d09fcc7db2a77d34ef7127865
18.7 kB Download
0
0
views
downloads
All versions This version
Views 00
Downloads 00
Data volume 0 Bytes0 Bytes
Unique views 00
Unique downloads 00

Share

Cite as