发布求助
文献互助 智能选刊 最新文献

Formal Methods in System Design最新文献

筛选
英文 中文
Specifiable robustness in reactive synthesis 反应合成中的特定鲁棒性
IF 0.8 4区 计算机科学
Formal Methods in System Design Pub Date : 2022-04-01 DOI: 10.1007/s10703-023-00418-x
R. Bloem, Hana Chockler, M. Ebrahimi, O. Strichman
{"title":"Specifiable robustness in reactive synthesis","authors":"R. Bloem, Hana Chockler, M. Ebrahimi, O. Strichman","doi":"10.1007/s10703-023-00418-x","DOIUrl":"https://doi.org/10.1007/s10703-023-00418-x","url":null,"abstract":"","PeriodicalId":12430,"journal":{"name":"Formal Methods in System Design","volume":"60 1","pages":"259 - 276"},"PeriodicalIF":0.8,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47937876","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Assumption-based Runtime Verification 基于假设的运行时验证
IF 0.8 4区 计算机科学
Formal Methods in System Design Pub Date : 2022-04-01 DOI: 10.1007/s10703-023-00416-z
A. Cimatti, Chun Tian, Stefano Tonetta
{"title":"Assumption-based Runtime Verification","authors":"A. Cimatti, Chun Tian, Stefano Tonetta","doi":"10.1007/s10703-023-00416-z","DOIUrl":"https://doi.org/10.1007/s10703-023-00416-z","url":null,"abstract":"","PeriodicalId":12430,"journal":{"name":"Formal Methods in System Design","volume":"60 1","pages":"277 - 324"},"PeriodicalIF":0.8,"publicationDate":"2022-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45139608","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Formal methods: practical applications and foundations: Editorial. 形式化方法：实际应用与基础》：编辑。
IF 0.8 4区 计算机科学
Formal Methods in System Design Pub Date : 2022-01-25 DOI: 10.1007/s10703-022-00388-6
Maurice H Ter Beek, Annabelle McIver
{"title":"Formal methods: practical applications and foundations: Editorial.","authors":"Maurice H Ter Beek, Annabelle McIver","doi":"10.1007/s10703-022-00388-6","DOIUrl":"10.1007/s10703-022-00388-6","url":null,"abstract":"","PeriodicalId":12430,"journal":{"name":"Formal Methods in System Design","volume":" ","pages":"1-4"},"PeriodicalIF":0.8,"publicationDate":"2022-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8788392/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"39871856","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Distributed bounded model checking 分布式有界模型检验
IF 0.8 4区 计算机科学
Formal Methods in System Design Pub Date : 2022-01-05 DOI: 10.1007/s10703-021-00385-1
Prantik Chatterjee, Subhajit Roy, Bui Phi Diep, Akash Lal
{"title":"Distributed bounded model checking","authors":"Prantik Chatterjee, Subhajit Roy, Bui Phi Diep, Akash Lal","doi":"10.1007/s10703-021-00385-1","DOIUrl":"https://doi.org/10.1007/s10703-021-00385-1","url":null,"abstract":"<p>Program verification is a resource-hungry task. This paper looks at the problem of parallelizing SMT-based automated program verification, specifically bounded model-checking, so that it can be distributed and executed on a cluster of machines. We present an algorithm that dynamically unfolds the call graph of the program and frequently splits it to create sub-tasks that can be solved in parallel. The algorithm is adaptive, controlling the splitting rate according to available resources, and also leverages information from the SMT solver to split where most complexity lies in the search. We implemented our algorithm by modifying <span>Corral</span>, the verifier used by Microsoft’s Static Driver Verifier (SDV), and evaluate it on a series of hard SDV benchmarks.\u0000</p>","PeriodicalId":12430,"journal":{"name":"Formal Methods in System Design","volume":"2003 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2022-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138539726","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Distributed bounded model checking 分布式有界模型检验
IF 0.8 4区 计算机科学
Formal Methods in System Design Pub Date : 2022-01-05 DOI: 10.1007/s10703-021-00385-1
Prantik Chatterjee, Subhajit Roy, Bui Phi Diep, Akash Lal
{"title":"Distributed bounded model checking","authors":"Prantik Chatterjee, Subhajit Roy, Bui Phi Diep, Akash Lal","doi":"10.1007/s10703-021-00385-1","DOIUrl":"https://doi.org/10.1007/s10703-021-00385-1","url":null,"abstract":"<p>Program verification is a resource-hungry task. This paper looks at the problem of parallelizing SMT-based automated program verification, specifically bounded model-checking, so that it can be distributed and executed on a cluster of machines. We present an algorithm that dynamically unfolds the call graph of the program and frequently splits it to create sub-tasks that can be solved in parallel. The algorithm is adaptive, controlling the splitting rate according to available resources, and also leverages information from the SMT solver to split where most complexity lies in the search. We implemented our algorithm by modifying <span>Corral</span>, the verifier used by Microsoft’s Static Driver Verifier (SDV), and evaluate it on a series of hard SDV benchmarks.\u0000</p>","PeriodicalId":12430,"journal":{"name":"Formal Methods in System Design","volume":"2003 1","pages":""},"PeriodicalIF":0.8,"publicationDate":"2022-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138539682","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Mining definitions in Kissat with Kittens. Kissat with Kittens中的挖掘定义。
IF 0.7 4区 计算机科学
Formal Methods in System Design Pub Date : 2022-01-01 Epub Date: 2023-04-24 DOI: 10.1007/s10703-023-00421-2
Mathias Fleury, Armin Biere
{"title":"Mining definitions in Kissat with Kittens.","authors":"Mathias Fleury, Armin Biere","doi":"10.1007/s10703-023-00421-2","DOIUrl":"10.1007/s10703-023-00421-2","url":null,"abstract":"<p><p>Bounded variable elimination is one of the most important preprocessing techniques in SAT solving. It benefits from discovering functional dependencies in the form of definitions encoded in the CNF. While the common approach pioneered in SatELite relies on syntactic pattern matching, our new approach uses cores produced by an embedded SAT solver, Kitten. In contrast to a similar semantic technique implemented in Lingeling based on BDD algorithms to generate irredundant CNFs, our new approach is able to generate DRAT proofs. We further discuss design choices for our embedded SAT solver Kitten. Experiments with Kissat show the effectiveness of this approach.</p>","PeriodicalId":12430,"journal":{"name":"Formal Methods in System Design","volume":"60 3","pages":"381-404"},"PeriodicalIF":0.7,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10564679/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41196832","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
SMT-based verification of program changes through summary repair. 通过汇总修复对程序更改进行基于SMT的验证。
IF 0.8 4区 计算机科学
Formal Methods in System Design Pub Date : 2022-01-01 Epub Date: 2023-05-04 DOI: 10.1007/s10703-023-00423-0
Sepideh Asadi, Martin Blicha, Antti E J Hyvärinen, Grigory Fedyukovich, Natasha Sharygina
{"title":"SMT-based verification of program changes through summary repair.","authors":"Sepideh Asadi,&nbsp;Martin Blicha,&nbsp;Antti E J Hyvärinen,&nbsp;Grigory Fedyukovich,&nbsp;Natasha Sharygina","doi":"10.1007/s10703-023-00423-0","DOIUrl":"10.1007/s10703-023-00423-0","url":null,"abstract":"<p><p>This article provides an innovative approach for verification by model checking of programs that undergo continuous changes. To tackle the problem of repeating the entire model checking for each new version of the program, our approach verifies programs incrementally. It reuses computational history of the previous program version, namely function summaries. In particular, the summaries are over-approximations of the bounded program behaviors. Whenever reusing of summaries is not possible straight away, our algorithm repairs the summaries to maximize the chance of reusability of them for subsequent runs. We base our approach on satisfiability modulo theories (SMT) to take full advantage of lightweight modeling approach and at the same time the ability to provide concise function summarization. Our approach leverages pre-computed function summaries in SMT to localize the checks of changed functions. Furthermore, to exploit the trade-off between precision and performance, our approach relies on the use of an SMT solver, not only for underlying reasoning, but also for program modeling and the adjustment of its precision. On the benchmark suite of primarily Linux device drivers versions, we demonstrate that our algorithm achieves an order of magnitude speedup compared to prior approaches.</p>","PeriodicalId":12430,"journal":{"name":"Formal Methods in System Design","volume":"60 3","pages":"350-380"},"PeriodicalIF":0.8,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10564826/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41196833","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Automated repair for timed systems 自动修复定时系统
IF 0.8 4区 计算机科学
Formal Methods in System Design Pub Date : 2021-12-01 DOI: 10.1007/s10703-022-00397-5
Martin Kölbl, S. Leue, Thomas Wies
{"title":"Automated repair for timed systems","authors":"Martin Kölbl, S. Leue, Thomas Wies","doi":"10.1007/s10703-022-00397-5","DOIUrl":"https://doi.org/10.1007/s10703-022-00397-5","url":null,"abstract":"","PeriodicalId":12430,"journal":{"name":"Formal Methods in System Design","volume":"59 1","pages":"136 - 169"},"PeriodicalIF":0.8,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48520432","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Bridging the gap between single- and multi-model predictive runtime verification 弥合单模型和多模型预测运行时验证之间的差距
IF 0.8 4区 计算机科学
Formal Methods in System Design Pub Date : 2021-12-01 DOI: 10.1007/s10703-022-00395-7
Angelo Ferrando, R. C. Cardoso, M. Farrell, Matt Luckcuck, Fabio Papacchini, M. Fisher, V. Mascardi
{"title":"Bridging the gap between single- and multi-model predictive runtime verification","authors":"Angelo Ferrando, R. C. Cardoso, M. Farrell, Matt Luckcuck, Fabio Papacchini, M. Fisher, V. Mascardi","doi":"10.1007/s10703-022-00395-7","DOIUrl":"https://doi.org/10.1007/s10703-022-00395-7","url":null,"abstract":"","PeriodicalId":12430,"journal":{"name":"Formal Methods in System Design","volume":"1 1","pages":"1-33"},"PeriodicalIF":0.8,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42527213","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Relational abstract interpretation of arrays in assembly code 汇编代码中数组的关系抽象解释
IF 0.8 4区 计算机科学
Formal Methods in System Design Pub Date : 2021-12-01 DOI: 10.1007/s10703-022-00399-3
C. Ballabriga, J. Forget, Jordy Ruiz
{"title":"Relational abstract interpretation of arrays in assembly code","authors":"C. Ballabriga, J. Forget, Jordy Ruiz","doi":"10.1007/s10703-022-00399-3","DOIUrl":"https://doi.org/10.1007/s10703-022-00399-3","url":null,"abstract":"","PeriodicalId":12430,"journal":{"name":"Formal Methods in System Design","volume":"27 1","pages":"103 - 135"},"PeriodicalIF":0.8,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52227103","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信