Approximate verification in an open source world

作     者：Breuer, Peter T. Pickin, Simon 

作者机构：Univ Birmingham Dept Comp Sci Birmingham W Midlands England Univ Carlos III Madrid Dpto Ingn Telemat Leganes Madrid Spain 

出 版 物：《INNOVATIONS IN SYSTEMS AND SOFTWARE ENGINEERING》 (系统与软件工程创新)

年 卷 期：2008年第4卷第1期

页      面：87-105页

学科分类：08[工学] 0835[工学-软件工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：Open source Static analysis Linux kernel Programming logic Verification 

摘      要：This article details advances in a lightweight technology we have evolved to handle post hoc verification in the very large, uncontrolled and rapidly evolving code-bases exemplified by C language open source projects such as the Linux kernel. Successful operation in this context means timeliness, and we are currently treating millions of lines of unrestricted mixed C and assembler source code in a few hours on very modest platforms. The technology is soundly based, in that it delivers false alarms (in a ratio of about 8 to 1 in practice), rather than misses true alarms. Speed of operation is traded off against accuracy via configuration of a program logic tailored to each analysis. The program logic specification language and the theory behind it will be described here.