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}
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.