Inference rules for proving the equivalence of recursive procedures
Acta Informatica
Proceedings of the 46th Annual Design Automation Conference
Generating regression unit tests using a combination of verification and capture & replay
TAP'10 Proceedings of the 4th international conference on Tests and proofs
Continuity and robustness of programs
Communications of the ACM
Hi-index | 0.02 |
The ability to prove equivalence of successive, closely-related versions of a program can be useful for maintaining backward compatibility. This problem has the potential of being easier in practice than functional verification for at least two reasons: First, it circumvents the problem of specifying what the program should do; Second, in many cases it is computationally easier, because it offers various opportunities for abstraction and decomposition that are only relevant in this context.