Regression Verification

被引:0
作者
Godlin, Benny [1 ]
Strichman, Ofer [2 ]
机构
[1] Technion, CS, Haifa, Israel
[2] Technion, IE, Haifa, Israel
来源
DAC: 2009 46TH ACM/IEEE DESIGN AUTOMATION CONFERENCE, VOLS 1 AND 2 | 2009年
关键词
Software verification; Equivalence checking; TRANSLATION VALIDATION;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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 two main reasons for this claim: it circumvents the problem of specifying what the program should do, and in many cases it is computationally easier. We study theoretical and practical aspects of this problem, which we call regression verification.
引用
收藏
页码:466 / +
页数:2
相关论文
共 14 条
[1]  
ARONS T, 2005, LNCS, V3576
[2]  
GODLIN B, 2008, THESIS ISRAEL I TECH
[3]   Inference rules for proving the equivalence of recursive procedures [J].
Godlin, Benny ;
Strichman, Ofer .
ACTA INFORMATICA, 2008, 45 (06) :403-439
[4]  
Groce A, 2004, LECT NOTES COMPUT SC, V3114, P453
[5]  
Haroud M, 2005, LECT NOTES COMPUT SC, V3530, P323
[6]  
HOARE C, 1971, P S SEM ALG LANG
[7]   AN AXIOMATIC BASIS FOR COMPUTER PROGRAMMING [J].
HOARE, CAR .
COMMUNICATIONS OF THE ACM, 1969, 12 (10) :576-&
[8]   The verifying compiler: A grand challenge for computing research [J].
Hoare, T .
JOURNAL OF THE ACM, 2003, 50 (01) :63-69
[9]  
KROENING D, 2003, P DAC 2003, P368
[10]  
Kroening D, 2008, TEXTS THEOR COMPUT S, P1