Inference rules for proving the equivalence of recursive procedures

Authors:
Benny Godlin;Ofer Strichman
Affiliations:
Technion, Department of Computer Science, Haifa, Israel;Technion, Information Systems, IE, Haifa, Israel
Venue:
Acta Informatica
Year:
2008

Citing 0
Cited 7

Regression Verification: Proving the Equivalence of Similar Programs

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Regression verification

Proceedings of the 46th Annual Design Automation Conference
Inference rules for proving the equivalence of recursive procedures

Time for verification
Regression verification for multi-threaded programs

VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Equivalence checking of static affine programs using widening to handle recurrences

ACM Transactions on Programming Languages and Systems (TOPLAS)
Towards modularly comparing programs using automated theorem provers

CADE'13 Proceedings of the 24th international conference on Automated Deduction
Proving mutual termination of programs

HVC'12 Proceedings of the 8th international conference on Hardware and Software: verification and testing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Inspired by Hoare’s rule for recursive procedures, we present three proof rules for the equivalence between recursive programs. The first rule can be used for proving partial equivalence of programs; the second can be used for proving their mutual termination; the third rule can be used for proving the equivalence of reactive programs. There are various applications to such rules, such as proving equivalence of programs after refactoring and proving backward compatibility.