Regression Verification: Proving the Equivalence of Similar Programs

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: 1) it circumvents the problem of specifying what the program should do, 2) the problem can be naturally decomposed and… CONTINUE READING

4 Figures & Tables



Citations per Year

75 Citations

Semantic Scholar estimates that this publication has 75 citations based on the available data.

See our FAQ for additional information.