轻量级和大型的验证:快速移动的开源C项目的大规模验证

Peter T. Breuer, S. Pickin
{"title":"轻量级和大型的验证:快速移动的开源C项目的大规模验证","authors":"Peter T. Breuer, S. Pickin","doi":"10.1109/SEW.2007.113","DOIUrl":null,"url":null,"abstract":"A lightweight approach to the verification of software at large scales, called \"symbolic approximation\", has been developed in order to achieve post-hoc verification of C code in fast-moving open source projects such as the Linux kernel. While other approaches such as model-checking were known to be technically sound beforehand and were subsequently scaled up to treat larger problems, symbolic approximation was created to first of all work expediently at very large scales and absolute formal correctness is being adduced only afterwards. In this paper we report just a few new details and advances in the technology but supply new global reasoning supporting its correctness.","PeriodicalId":277367,"journal":{"name":"31st IEEE Software Engineering Workshop (SEW 2007)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Verification in the Light and Large: Large-Scale Verification for Fast-Moving Open Source C Projects\",\"authors\":\"Peter T. Breuer, S. Pickin\",\"doi\":\"10.1109/SEW.2007.113\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A lightweight approach to the verification of software at large scales, called \\\"symbolic approximation\\\", has been developed in order to achieve post-hoc verification of C code in fast-moving open source projects such as the Linux kernel. While other approaches such as model-checking were known to be technically sound beforehand and were subsequently scaled up to treat larger problems, symbolic approximation was created to first of all work expediently at very large scales and absolute formal correctness is being adduced only afterwards. In this paper we report just a few new details and advances in the technology but supply new global reasoning supporting its correctness.\",\"PeriodicalId\":277367,\"journal\":{\"name\":\"31st IEEE Software Engineering Workshop (SEW 2007)\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-03-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"31st IEEE Software Engineering Workshop (SEW 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SEW.2007.113\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"31st IEEE Software Engineering Workshop (SEW 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SEW.2007.113","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

为了在快速发展的开源项目(如Linux内核)中实现对C代码的事后验证,已经开发了一种用于大规模软件验证的轻量级方法,称为“符号近似”。虽然其他方法,如模型检查,事先在技术上是合理的,随后扩展到处理更大的问题,但符号近似的创建首先是为了在非常大的范围内方便地工作,然后才引入绝对的形式正确性。在本文中,我们只报告了一些新的细节和技术的进展,但提供了新的全局推理来支持其正确性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Verification in the Light and Large: Large-Scale Verification for Fast-Moving Open Source C Projects
A lightweight approach to the verification of software at large scales, called "symbolic approximation", has been developed in order to achieve post-hoc verification of C code in fast-moving open source projects such as the Linux kernel. While other approaches such as model-checking were known to be technically sound beforehand and were subsequently scaled up to treat larger problems, symbolic approximation was created to first of all work expediently at very large scales and absolute formal correctness is being adduced only afterwards. In this paper we report just a few new details and advances in the technology but supply new global reasoning supporting its correctness.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Abstracting Pointers for a Verifying Compiler Mise en Scene: Converting Scenarios to CSP Traces in Support of Requirements-Based Programming A Generative Approach to Building a Framework for Hard Real-Time Applications Algebraic Approach to Operational Semantics and Observation-Oriented Semantics for a Timed Shared-Variable Language with Probability An Operational Approach to BPEL-like Programming
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1