Journal of Automated Reasoning最新文献

Combining Higher-Order Logic with Set Theory Formalizations. 将高阶逻辑与集合论形式化相结合。

IF 1.1 3区计算机科学

Journal of Automated Reasoning Pub Date : 2023-01-01 Epub Date: 2023-05-25 DOI: 10.1007/s10817-023-09663-5

Cezary Kaliszyk, Karol Pąk

引用次数: 0

Synthesising Programs with Non-trivial Constants. 合成具有非平凡常数的程序。

IF 1.1 3区计算机科学

Journal of Automated Reasoning Pub Date : 2023-01-01 Epub Date: 2023-05-13 DOI: 10.1007/s10817-023-09664-4

Alessandro Abate, Haniel Barbosa, Clark Barrett, Cristina David, Pascal Kesseli, Daniel Kroening, Elizabeth Polgreen, Andrew Reynolds, Cesare Tinelli

{"title":"Synthesising Programs with Non-trivial Constants.","authors":"Alessandro Abate, Haniel Barbosa, Clark Barrett, Cristina David, Pascal Kesseli, Daniel Kroening, Elizabeth Polgreen, Andrew Reynolds, Cesare Tinelli","doi":"10.1007/s10817-023-09664-4","DOIUrl":"10.1007/s10817-023-09664-4","url":null,"abstract":"<p><p>Program synthesis is the mechanised construction of software. One of the main difficulties is the efficient exploration of the very large solution space, and tools often require a user-provided syntactic restriction of the search space. While useful in general, such syntactic restrictions provide little help for the generation of programs that contain non-trivial constants, unless the user is able to provide the constants in advance. This is a fundamentally difficult task for state-of-the-art synthesisers. We propose a new approach to the synthesis of programs with non-trivial constants that combines the strengths of a counterexample-guided inductive synthesiser with those of a theory solver, exploring the solution space more efficiently without relying on user guidance. We call this approach CEGIS(<math><mi>T</mi></math>), where <math><mi>T</mi></math> is a first-order theory. We present two exemplars, one based on Fourier-Motzkin (FM) variable elimination and one based on first-order satisfiability. We demonstrate the practical value of CEGIS(<math><mi>T</mi></math>) by automatically synthesising programs for a set of intricate benchmarks. Additionally, we present a case study where we integrate CEGIS(<math><mi>T</mi></math>) within the mature synthesiser CVC4 and show that CEGIS(<math><mi>T</mi></math>) improves CVC4's results.</p>","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"67 2","pages":"19"},"PeriodicalIF":1.1,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10182957/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9476445","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Unifying Splitting. 统一分裂。

IF 1.1 3区计算机科学

Journal of Automated Reasoning Pub Date : 2023-01-01 DOI: 10.1007/s10817-023-09660-8

Gabriel Ebner, Jasmin Blanchette, Sophie Tourret

引用次数: 1

First-Order Theory of Rewriting for Linear Variable-Separated Rewrite Systems: Automation, Formalization, Certification. 线性变量分离重写系统的一阶重写理论:自动化、形式化、证明。

IF 1.1 3区计算机科学

Journal of Automated Reasoning Pub Date : 2023-01-01 DOI: 10.1007/s10817-023-09661-7

Aart Middeldorp, Alexander Lochmann, Fabian Mitterwallner

引用次数: 0