Regression verification: proving the equivalence of similar programs

@article{Godlin2013RegressionVP,
  title={Regression verification: proving the equivalence of similar programs},
  author={Benny Godlin and O. Strichman},
  journal={Software Testing},
  year={2013},
  volume={23}
}
  • Benny Godlin, O. Strichman
  • Published 2013
  • Computer Science
  • Software Testing
  • Proving the equivalence of successive, closely related versions of a program has the potential of being easier in practice than functional verification, although both problems are undecidable. There are three main reasons for this claim: (i) it circumvents the problem of specifying what the program should do; (ii) the problem can be naturally decomposed and hence is computationally easier; and (iii) there is an automatic invariant that enables to prove equivalence of loops and recursive… CONTINUE READING
    49 Citations
    Automating regression verification
    • 97
    • PDF
    Program Equivalence by Circular Reasoning
    • 14
    • PDF
    Trends in Relational Program Verification
    • 7
    • PDF
    A language-independent proof system for full program equivalence
    • 17
    • PDF
    Program equivalence by circular reasoning
    • 19
    • PDF
    Reducing Partial Equivalence to Partial Correctness
    • Stefan Ciobaca
    • Mathematics, Computer Science
    • 2014 16th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
    • 2014
    • 4
    Verifying Procedural Programs via Constrained Rewriting Induction
    • 14
    • PDF

    References

    SHOWING 1-10 OF 31 REFERENCES
    Regression verification
    • 110
    • PDF
    Conditional Equivalence
    • 41
    • PDF
    Relational Verification Using Product Programs
    • 169
    • PDF
    Proving the Equivalence of CLP Programs
    • 16
    Cutpoints for formal equivalence verification of embedded software
    • 20
    • PDF
    Behavioral consistency of C and Verilog programs using bounded model checking
    • 292
    • Highly Influential
    • PDF
    Understanding Counterexamples with explain
    • 63
    • PDF
    Procedures and parameters: An axiomatic approach
    • C. Hoare
    • Computer Science
    • Symposium on Semantics of Algorithmic Languages
    • 1971
    • 328
    • Highly Influential
    • PDF