Inference rules for proving the equivalence of recursive procedures
2010
We present two proof rules for the equivalence of recursive procedures, in the style of Hoare's rule for recursive invocation of procedures. The first rule can be used for proving partial equivalence of programs; the second can be used for proving their mutual termination. There are various applications to these rules, such as proving backward compatibility.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
18
References
15
Citations
NaN
KQI