Developing a self-applicable verification system. Theory and practice

被引:2
|
作者
Kondratyev D.A. [1 ]
Promsky A.V. [2 ]
机构
[1] Novosibirsk State University, ul. Pirogova 2, Novosibirsk
[2] Ershov Institute of Informatics Systems SB RAS, pr. Academika Lavrent’eva 6, Novosibirsk
来源
Autom. Control Comput. Sci. | / 7卷 / 445-452期
基金
俄罗斯基础研究基金会;
关键词
axiomatic semantics; MetaVCG; specification; the C-light language; verification; verification condition;
D O I
10.3103/S0146411615070123
中图分类号
学科分类号
摘要
Compared with traditional testing, the deductive verification represents a more formal way to establish the program correctness. However, can we be sure that the verification system itself is correct? The theoretical foundations of Hoare logic were examined in classical works, and some soundness/completeness theorems are well known. Nevertheless, we practically are not aware of implementations of those theoretical methods subjected to anything more than testing. In other words, our ultimate goal is a verification system that can be self-applicable (at least partially). In our recent studies, we applied the MetaVCG approach in order to make such a task more feasible. © 2015, Allerton Press, Inc.
引用
收藏
页码:445 / 452
页数:7
相关论文
共 50 条