Inference rules for proving the equivalence of recursive procedures

Authors:
Benny Godlin;Ofer Strichman
Affiliations:
Computer Science, Technion, Haifa, Israel;Information Systems Engineering, IE, Technion, Haifa, Israel
Venue:
Time for verification
Year:
2010

Citing 11
Cited 0

Efficiently computing static single assignment form and the control dependence graph

ACM Transactions on Programming Languages and Systems (TOPLAS)
An axiomatic basis for computer programming

Communications of the ACM
Program Verification

Program Verification
Proving the Equivalence of CLP Programs

ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Translation Validation for Synchronous Languages

ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Behavioral consistency of C and verilog programs using bounded model checking

Proceedings of the 40th annual Design Automation Conference
Ordinal Arithmetic: Algorithms and Mechanization

Journal of Automated Reasoning
Inference rules for proving the equivalence of recursive procedures

Acta Informatica
Kernel equivalence of programs and proving kernel equivalence and correctness by test cases

IJCAI'71 Proceedings of the 2nd international joint conference on Artificial intelligence
Regression verification

Proceedings of the 46th Annual Design Automation Conference
On formalised computer programs

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.