Pub Date : 2023-06-29DOI: 10.48550/arXiv.2306.16757
Philipp Bär, Jasper Nalbach, Erika 'Abrah'am, Christopher W. Brown
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.
{"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}
Pub Date : 2023-06-15DOI: 10.48550/arXiv.2306.09436
C. Lynch, Stephen Miner
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.
{"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}
Chaitanya Mangla, S. Holden, Lawrence Charles Paulson
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.
{"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}
Pub Date : 2020-07-02DOI: 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}
Pub Date : 2018-04-19DOI: 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}
Pub Date : 2014-09-08DOI: 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}
Pub Date : 2013-07-13DOI: 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}
Pub Date : 1900-01-01DOI: 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}
Pub Date : 1900-01-01DOI: 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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：