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

International Workshop on Satisfiability Modulo Theories最新文献

筛选
英文 中文
Exploiting Strict Constraints in the Cylindrical Algebraic Covering 利用圆柱代数覆盖中的严格约束
International Workshop on Satisfiability Modulo Theories Pub Date : 2023-06-29 DOI: 10.48550/arXiv.2306.16757
Philipp Bär, Jasper Nalbach, Erika 'Abrah'am, Christopher W. Brown
{"title":"Exploiting Strict Constraints in the Cylindrical Algebraic Covering","authors":"Philipp Bär, Jasper Nalbach, Erika 'Abrah'am, Christopher W. Brown","doi":"10.48550/arXiv.2306.16757","DOIUrl":"https://doi.org/10.48550/arXiv.2306.16757","url":null,"abstract":"One of the few available complete methods for checking the satisfiability of sets of polynomial constraints over the reals is the cylindrical algebraic covering (CAlC) method. In this paper, we propose an extension for this method to exploit the strictness of input constraints for reducing the computational effort. We illustrate the concepts on a multidimensional example and provide experimental results to evaluate the usefulness of our proposed extension.","PeriodicalId":114068,"journal":{"name":"International Workshop on Satisfiability Modulo Theories","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126430289","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Complete Trigger Selection in Satisfiability modulo first-order Theories 可满足模一阶理论中的完全触发选择
International Workshop on Satisfiability Modulo Theories Pub Date : 2023-06-15 DOI: 10.48550/arXiv.2306.09436
C. Lynch, Stephen Miner
{"title":"Complete Trigger Selection in Satisfiability modulo first-order Theories","authors":"C. Lynch, Stephen Miner","doi":"10.48550/arXiv.2306.09436","DOIUrl":"https://doi.org/10.48550/arXiv.2306.09436","url":null,"abstract":"Let T be an SMT solver with no theory solvers except for Quantifier Instantiation. Given a set of first-order clauses S saturated by Resolution (with a valid literal selection function) we show that T is complete if its Trigger function is the same as the literal selection function. So if T halts with a ground model G, then G can be extended to a model in the theory of S. In addition for a suitable ordering, if all maximal literals are selected in each clause, then T will halt on G, so it is a decision procedure for the theory S. Also, for a suitable ordering, if all clauses are Horn, or all clauses are 2SAT, then T solves the theory S in polynomial time.","PeriodicalId":114068,"journal":{"name":"International Workshop on Satisfiability Modulo Theories","volume":"147 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123385379","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Bayesian Optimisation of Solver Parameters in CBMC CBMC中求解器参数的贝叶斯优化
International Workshop on Satisfiability Modulo Theories Pub Date : 2020-07-20 DOI: 10.17863/CAM.55257
Chaitanya Mangla, S. Holden, Lawrence Charles Paulson
{"title":"Bayesian Optimisation of Solver Parameters in CBMC","authors":"Chaitanya Mangla, S. Holden, Lawrence Charles Paulson","doi":"10.17863/CAM.55257","DOIUrl":"https://doi.org/10.17863/CAM.55257","url":null,"abstract":"Satisfiability solvers can be embedded in applications to perform specific formal reasoning tasks. CBMC, for example, is a bounded model checker for C and C++ that embeds SMT and SAT solvers to check internally generated formulae. Such solvers will be solely used to evaluate the class of formulae generated by the embedding application and therefore may benefit from domain-specific parameter tuning. We propose the use of Bayesian optimisation for this purpose, which offers a principled approach to black-box optimisation within limited resources. We demonstrate its use for optimisation of the solver embedded in CBMC specifically for a collection of test harnesses in active industrial use, for which we have achieved a significant improvement over the default parameters.","PeriodicalId":114068,"journal":{"name":"International Workshop on Satisfiability Modulo Theories","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127461043","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Smt-Switch: A Solver-agnostic C++ API for SMT Solving SMT - switch:用于SMT求解的求解器无关的c++ API
International Workshop on Satisfiability Modulo Theories Pub Date : 2020-07-02 DOI: 10.1007/978-3-030-80223-3_26
Makai Mann, Amalee Wilson, C. Tinelli, Clark W. Barrett
{"title":"Smt-Switch: A Solver-agnostic C++ API for SMT Solving","authors":"Makai Mann, Amalee Wilson, C. Tinelli, Clark W. Barrett","doi":"10.1007/978-3-030-80223-3_26","DOIUrl":"https://doi.org/10.1007/978-3-030-80223-3_26","url":null,"abstract":"","PeriodicalId":114068,"journal":{"name":"International Workshop on Satisfiability Modulo Theories","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-07-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114343055","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Efficient Interpolation for the Theory of Arrays 阵列理论的有效插值
International Workshop on Satisfiability Modulo Theories Pub Date : 2018-04-19 DOI: 10.1007/978-3-319-94205-6_36
Jochen Hoenicke, Tanja I. Schindler
{"title":"Efficient Interpolation for the Theory of Arrays","authors":"Jochen Hoenicke, Tanja I. Schindler","doi":"10.1007/978-3-319-94205-6_36","DOIUrl":"https://doi.org/10.1007/978-3-319-94205-6_36","url":null,"abstract":"","PeriodicalId":114068,"journal":{"name":"International Workshop on Satisfiability Modulo Theories","volume":"296 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132191973","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 15
Towards Conflict-Driven Learning for Virtual Substitution 面向虚拟替代的冲突驱动学习
International Workshop on Satisfiability Modulo Theories Pub Date : 2014-09-08 DOI: 10.1007/978-3-319-10515-4_19
Konstantin Korovin, M. Kosta, T. Sturm
{"title":"Towards Conflict-Driven Learning for Virtual Substitution","authors":"Konstantin Korovin, M. Kosta, T. Sturm","doi":"10.1007/978-3-319-10515-4_19","DOIUrl":"https://doi.org/10.1007/978-3-319-10515-4_19","url":null,"abstract":"","PeriodicalId":114068,"journal":{"name":"International Workshop on Satisfiability Modulo Theories","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122076668","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Weakly Equivalent Arrays 弱等效数组
International Workshop on Satisfiability Modulo Theories Pub Date : 2014-05-27 DOI: 10.1007/978-3-319-24246-0_8
Jürgen Christ, Jochen Hoenicke
{"title":"Weakly Equivalent Arrays","authors":"Jürgen Christ, Jochen Hoenicke","doi":"10.1007/978-3-319-24246-0_8","DOIUrl":"https://doi.org/10.1007/978-3-319-24246-0_8","url":null,"abstract":"","PeriodicalId":114068,"journal":{"name":"International Workshop on Satisfiability Modulo Theories","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126783373","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
Multi-solver Support in Symbolic Execution 符号执行中的多求解器支持
International Workshop on Satisfiability Modulo Theories Pub Date : 2013-07-13 DOI: 10.1007/978-3-642-39799-8_3
H. Palikareva, Cristian Cadar
{"title":"Multi-solver Support in Symbolic Execution","authors":"H. Palikareva, Cristian Cadar","doi":"10.1007/978-3-642-39799-8_3","DOIUrl":"https://doi.org/10.1007/978-3-642-39799-8_3","url":null,"abstract":"","PeriodicalId":114068,"journal":{"name":"International Workshop on Satisfiability Modulo Theories","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122142606","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 72
Abstract: Reliable Reconstruction of Fine-Grained Proofs in a Proof Assistant 摘要:在一个证明助手中实现细粒度证明的可靠重构
International Workshop on Satisfiability Modulo Theories Pub Date : 1900-01-01 DOI: 10.1007/978-3-030-79876-5_26
Hans-Jörg Schurr, M. Fleury, Martin Desharnais
{"title":"Abstract: Reliable Reconstruction of Fine-Grained Proofs in a Proof Assistant","authors":"Hans-Jörg Schurr, M. Fleury, Martin Desharnais","doi":"10.1007/978-3-030-79876-5_26","DOIUrl":"https://doi.org/10.1007/978-3-030-79876-5_26","url":null,"abstract":"","PeriodicalId":114068,"journal":{"name":"International Workshop on Satisfiability Modulo Theories","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127306887","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Abstract: BanditFuzz: A Reinforcement-Learning based Performance Fuzzer for SMT Solvers 摘要:BanditFuzz:基于强化学习的SMT求解器性能模糊器
International Workshop on Satisfiability Modulo Theories Pub Date : 1900-01-01 DOI: 10.1007/978-3-030-63618-0_5
Joseph Scott, Federico Mora, Vijay Ganesh
{"title":"Abstract: BanditFuzz: A Reinforcement-Learning based Performance Fuzzer for SMT Solvers","authors":"Joseph Scott, Federico Mora, Vijay Ganesh","doi":"10.1007/978-3-030-63618-0_5","DOIUrl":"https://doi.org/10.1007/978-3-030-63618-0_5","url":null,"abstract":"","PeriodicalId":114068,"journal":{"name":"International Workshop on Satisfiability Modulo Theories","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115056076","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 10
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学术官方微信