通过抽象程序证明复杂具体程序  

Verification of Concrete Programs with Respect to Abstract Programs

作　　者：李彬[1] 汤震浩[1] 翟娟[1] 赵建华[1] 

机构地区：[1]计算机软件新技术国家重点实验室(南京大学),江苏南京210023

出　　处：《软件学报》2017年第4期786-803,共18页Journal of Software

基　　金：国家自然科学基金(61632015;61561146394);国家重点基础研究发展计划(973)(2016YFB1000802)~~

摘　　要：描述了证明抽象程序和具体程序满足一致性关系的方法.抽象程序使用抽象数据结构(ADTs),如set,list,map及其上的操作.具体程序使用类C语言中的类型.抽象程序和具体程序一致性证明需要用户给出抽象变量和具体变量的关系、抽象程序程序点和具体程序程序点的对应关系.基于对应关系,抽象程序和具体程序一致性证明可以分解,从而容易并可能自动证明.This paper presents an approach to prove that a concrete program correctly implements its corresponding abstract program. Here, an abstract program uses some abstract data types such as set, list and map, and abstract operations upon those data types. A concrete program uses the types in the C-like language. The approach presented in the paper requires to specify correspondences between the abstract program and the concrete program, including correspondences between program points and correspondences between variables. Based on the correspondences, the verification task can be divided into small subtasks that can be easily and mostly automatically verified.

关 键 词：程序证明 一致性 抽象程序 精化 分解 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]