基于smt的汇总修复的增量验证

Sepideh Asadi, Martin Blicha, A. Hyvärinen, Grigory Fedyukovich, N. Sharygina
{"title":"基于smt的汇总修复的增量验证","authors":"Sepideh Asadi, Martin Blicha, A. Hyvärinen, Grigory Fedyukovich, N. Sharygina","doi":"10.34727/2020/isbn.978-3-85448-042-6_14","DOIUrl":null,"url":null,"abstract":"We present Upprover, a bounded model checker designed to incrementally verify software while it is being gradually developed, refactored, or optimized. In contrast to its predecessor, a SAT-based tool EVOLCHECK, our tool exploits first-order theories available in SMT solvers, offering two more levels of encoding precision: linear arithmetic and uninterpreted functions, thus allowing a trade-off between precision and performance. Algorithmically Upprover is based on the reuse and repair of interpolation-based function summaries from one software version to another. Upprover leverages tree-interpolation systems in SMT to localize and speed up the checks of new versions. Upprover demonstrates an order of magnitude speedup on large-scale programs in comparison to EVOLCHECK and Hifrog, a non-incremental bounded model checker.","PeriodicalId":105705,"journal":{"name":"2020 Formal Methods in Computer Aided Design (FMCAD)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Incremental Verification by SMT-based Summary Repair\",\"authors\":\"Sepideh Asadi, Martin Blicha, A. Hyvärinen, Grigory Fedyukovich, N. Sharygina\",\"doi\":\"10.34727/2020/isbn.978-3-85448-042-6_14\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present Upprover, a bounded model checker designed to incrementally verify software while it is being gradually developed, refactored, or optimized. In contrast to its predecessor, a SAT-based tool EVOLCHECK, our tool exploits first-order theories available in SMT solvers, offering two more levels of encoding precision: linear arithmetic and uninterpreted functions, thus allowing a trade-off between precision and performance. Algorithmically Upprover is based on the reuse and repair of interpolation-based function summaries from one software version to another. Upprover leverages tree-interpolation systems in SMT to localize and speed up the checks of new versions. Upprover demonstrates an order of magnitude speedup on large-scale programs in comparison to EVOLCHECK and Hifrog, a non-incremental bounded model checker.\",\"PeriodicalId\":105705,\"journal\":{\"name\":\"2020 Formal Methods in Computer Aided Design (FMCAD)\",\"volume\":\"99 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-09-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 Formal Methods in Computer Aided Design (FMCAD)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_14\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 Formal Methods in Computer Aided Design (FMCAD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.34727/2020/isbn.978-3-85448-042-6_14","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

我们提出Upprover,这是一个有界模型检查器,设计用于在软件逐渐开发、重构或优化时增量地验证软件。与其前身基于sat的工具EVOLCHECK相比,我们的工具利用了SMT求解器中可用的一阶理论,提供了两个更高级别的编码精度:线性算法和未解释函数,从而允许在精度和性能之间进行权衡。算法上的Upprover是基于重用和修复基于插值的函数摘要从一个软件版本到另一个软件版本。Upprover利用SMT中的树插值系统来定位和加速新版本的检查。与EVOLCHECK和Hifrog(一个非增量的有界模型检查器)相比,Upprover在大型程序上展示了一个数量级的加速。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Incremental Verification by SMT-based Summary Repair
We present Upprover, a bounded model checker designed to incrementally verify software while it is being gradually developed, refactored, or optimized. In contrast to its predecessor, a SAT-based tool EVOLCHECK, our tool exploits first-order theories available in SMT solvers, offering two more levels of encoding precision: linear arithmetic and uninterpreted functions, thus allowing a trade-off between precision and performance. Algorithmically Upprover is based on the reuse and repair of interpolation-based function summaries from one software version to another. Upprover leverages tree-interpolation systems in SMT to localize and speed up the checks of new versions. Upprover demonstrates an order of magnitude speedup on large-scale programs in comparison to EVOLCHECK and Hifrog, a non-incremental bounded model checker.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信