Inference Rules for Proving the Equivalence of Recursive Procedures

@inproceedings{Godlin2010InferenceRF,
  title={Inference Rules for Proving the Equivalence of Recursive Procedures},
  author={Benny Godlin and Ofer Strichman},
  booktitle={Essays in Memory of Amir Pnueli},
  year={2010}
}
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. 
Highly Cited
This paper has 62 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 39 extracted citations

62 Citations

051015'10'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 62 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…