首页 | 本学科首页   官方微博 | 高级检索  
     


Approximate verification in an open source world
Authors:Peter T. Breuer  Simon Pickin
Affiliation:(1) Department of Computer Science, University of Birmingham, Birmingham, UK;(2) Dpto. Ingeniería Telemática, Universidad Carlos III de Madrid, Leganés (Madrid), Spain
Abstract:
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.
Keywords:Open source  Static analysis  Linux kernel  Programming logic  Verification
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号