Filters








348 Hits in 5.3 sec

Scalable Algorithms for Abduction via Enumerative Syntax-Guided Synthesis [chapter]

Andrew Reynolds, Haniel Barbosa, Daniel Larraz, Cesare Tinelli
2020 Lecture Notes in Computer Science  
We propose an approach for solving this problem that is based on syntax-guided enumeration.  ...  Our approach is fully general and can be applied over any background logic that is handled by the underlying SMT solver in our approach.  ...  In addition, we see a number of promising applications in the context of SMT itself. For example, we plan to use abduction to generate useful conditional rewrite rules for SMT solvers.  ... 
doi:10.1007/978-3-030-51074-9_9 fatcat:d6ndidsc4ffjbams3nj2gfujfq

cvc4sy: Smart and Fast Term Enumeration for Syntax-Guided Synthesis [chapter]

Andrew Reynolds, Haniel Barbosa, Andres Nötzli, Clark Barrett, Cesare Tinelli
2019 Lecture Notes in Computer Science  
We present CVC4SY, a syntax-guided synthesis (SyGuS) solver based on three bounded term enumeration strategies.  ...  Our implementation of the strategies within the satisfiability modulo theories (SMT) solver CVC4 and a heuristic to choose between them leads to significant improvements over state-of-the-art SyGuS solvers  ...  (SMT) solver [8, 9] , checks them and provides counterexamples for failures.  ... 
doi:10.1007/978-3-030-25543-5_5 fatcat:iicqyqsl3jaelnj7fadrkm3teu

SyGuS Techniques in the Core of an SMT Solver

Andrew Reynolds, Cesare Tinelli
2017 Electronic Proceedings in Theoretical Computer Science  
We give an overview of recent techniques for implementing syntax-guided synthesis (SyGuS) algorithms in the core of Satisfiability Modulo Theories (SMT) solvers.  ...  Conclusions and Future Work We have presented techniques for integrating techniques for syntax-guided synthesis in the core of a DPLL(T)-based SMT solver.  ...  For future work, we are investigating cases where synthesis by quantifier instantiation and synthesis by syntax-guided enumeration can be combined, as well as investigating efficient quantifier instantiation  ... 
doi:10.4204/eptcs.260.8 fatcat:p7ggkwrnonhy7dnar5oxyww73y

Rewrite Rule Inference Using Equality Saturation [article]

Chandrakana Nandi, Max Willsey, Amy Zhu, Yisu Remy Wang, Brett Saiki, Adam Anderson, Adriana Schulz, Dan Grossman, Zachary Tatlock
2021 arXiv   pre-print
E-graphs can compactly represent the exponentially large sets of enumerated terms and potential rewrite rules.  ...  This paper explores how equality saturation, a promising technique that uses e-graphs to apply rewrite rules, can also be used to infer rewrite rules.  ...  We are grateful to Andrew Reynolds for answering our questions about CVC4's rule synthesis component, to Pavel Panchekha and Oliver Flatt for helping us run Herbie with Ruler's rules, and to Sorawee Porncharoenwase  ... 
arXiv:2108.10436v1 fatcat:254trb66wjbcpku7ifyzsz3mpq

ReGiS: Regular Expression Simplification via Rewrite-Guided Synthesis [article]

Jordan Schmerge, Miles Claver, Jackson Garner, Jake Vossen, Jedidiah McClurg
2021 arXiv   pre-print
Syntax-guided synthesis (SyGuS) with a cost function can be used for this purpose, but ordered enumeration through a large space of candidate expressions can be expensive.  ...  We present a new approach called rewrite-guided synthesis (ReGiS), in which a unique interplay between SyGuS and equality saturation-based rewriting helps to overcome these problems, resulting in an efficient  ...  One notable approach is syntax-guided synthesis (SyGuS) [2] , which has leveraged domain-specific languages (DSLs) and exploited fast solvers (e.g., SAT and SMT [36] ) to produce synthesizers usable  ... 
arXiv:2104.12039v2 fatcat:urxthgmb7jcxnmw3dsa2ns32xu

Pono: A Flexible and Extensible SMT-Based Model Checker [chapter]

Makai Mann, Ahmed Irfan, Florian Lonsing, Yahan Yang, Hongce Zhang, Kristopher Brown, Aarti Gupta, Clark Barrett
2021 Lecture Notes in Computer Science  
and extensibility (it is easy to add new algorithms and new back-end solvers).  ...  In service of this goal, we present , an open-source SMT-based model checker. is designed to be both a research platform for developing and improving model checking algorithms, as well as a performance-competitive  ...  We thank these sponsors and our industry collaborators for their support.  ... 
doi:10.1007/978-3-030-81688-9_22 fatcat:yumutqpjtbfgpk2yzersx44ydy

Meta-F $$^\star $$ : Proof Automation with SMT, Tactics, and Metaprograms [chapter]

Guido Martínez, Danel Ahman, Victor Dumitrescu, Nick Giannarakis, Chris Hawblitzel, Cătălin Hriţcu, Monal Narasimhamurthy, Zoe Paraskevopoulou, Clément Pit-Claudel, Jonathan Protzenko, Tahina Ramananandro, Aseem Rastogi (+1 others)
2019 Lecture Notes in Computer Science  
In program verifiers the programmer often guides the solver towards the proof by supplying intermediate assertions.  ...  On the one hand, most interactive provers have gained support for exploiting SMT solvers or other ATPs, providing push-button automation for certain kinds of assertions [26, 31, 43, 44, 54] .  ...  Previously: Guiding SMT Solvers by Manually Applying Lemmas.  ... 
doi:10.1007/978-3-030-17184-1_2 fatcat:qcryxniccjbi5bh4wdw5f5ow3i

Two Decades of Maude [chapter]

Manuel Clavel, Francisco Durán, Steven Eker, Santiago Escobar, Patrick Lincoln, Narciso Martí-Oliet, Carolyn Talcott
2015 Lecture Notes in Computer Science  
This paper is not an introduction to Maude, and some familiarity with it and with rewriting logic are indeed assumed.  ...  This paper is a tribute to José Meseguer, from the rest of us in the Maude team, reviewing the past, the present, and the future of the language and system with which we have been working for around two  ...  An SMT rewriting search is initiated with the smt-search command, which has a syntax similar to the syntax of the search command.  ... 
doi:10.1007/978-3-319-23165-5_11 fatcat:cre7i55r4reg3indrng3w5fgqa

Meta-F*: Proof Automation with SMT, Tactics, and Metaprograms [article]

Guido Martínez, Danel Ahman, Victor Dumitrescu, Nick Giannarakis, Chris Hawblitzel, Catalin Hritcu, Monal Narasimhamurthy, Zoe Paraskevopoulou, Clément Pit-Claudel, Jonathan Protzenko, Tahina Ramananandro, Aseem Rastogi, Nikhil Swamy
2019 arXiv   pre-print
We introduce Meta-F*, a tactics and metaprogramming framework for the F* program verifier.  ...  The main novelty of Meta-F* is allowing the use of tactics and metaprogramming to discharge assertions not solvable by SMT, or to just simplify them into well-behaved SMT fragments.  ...  This proof is conceptually easy, but for large enumerations nested deep within the structure of other types, it is notoriously hard for SMT solvers.  ... 
arXiv:1803.06547v4 fatcat:4dcbmz5hs5dy5ftg2g4rvasxre

Scaling Enumerative Program Synthesis via Divide and Conquer [chapter]

Rajeev Alur, Arjun Radhakrishna, Abhishek Udupa
2017 Lecture Notes in Computer Science  
Given a semantic constraint specified by a logical formula, and syntactic constraints specified by a context-free grammar, the Syntax-Guided Synthesis (SyGuS) problem is to find an expression that satisfies  ...  Further, our solver is able to solve a large number of instances from the ICFP class of benchmarks, which were previously unsolved by all existing solvers.  ...  solver is to enumerate all expressions from the given syntax with some pruning.  ... 
doi:10.1007/978-3-662-54577-5_18 fatcat:w4oekwy72bf4jdb5ajxbtlmr4i

On the Unusual Effectiveness of Type-aware Mutations for Testing SMT Solvers [article]

Dominik Winterer, Chengyu Zhang, Zhendong Su
2020 arXiv   pre-print
These mutant formulas are then used as the test cases for SMT solvers.  ...  We propose type-aware operator mutation, a simple, but unusually effective approach for testing SMT solvers.  ...  In CVC4 we have tested, among many other options, syntax-guided synthesis procedure [24] by specifying --sygus-inference and higher order reasoning for uninterpreted functions by specifying --uf-ho.  ... 
arXiv:2004.08799v2 fatcat:facv7eqpszfldld5t2bz3hm7gi

Automatic Verification of TLA + Proof Obligations with SMT Solvers [chapter]

Stephan Merz, Hernán Vanzetto
2012 Lecture Notes in Computer Science  
In this paper we present a new backend for use with SMT solvers that supports elementary set theory, functions, arithmetic, tuples, and records.  ...  Type information required by the solvers is provided by a typing discipline for TLA + proof obligations, which helps us disambiguate the translation of expressions of (untyped) TLA + , while ensuring its  ...  Denis Cousineau, Damien Doligez, and Leslie Lamport provided constructive feedback on the design and implementation of the SMT backend.  ... 
doi:10.1007/978-3-642-28717-6_23 fatcat:ee2mekfmvrfqhhq4tzph3irgnu

Modelling Adaptation Policies as Domain-Specific Constraints [chapter]

Hui Song, Xiaodong Zhang, Nicolas Ferry, Franck Chauvel, Arnor Solberg, Gang Huang
2014 Lecture Notes in Computer Science  
system states for the various contexts, and (ii) figure out how to transform the system to satisfy these constraints.  ...  In order to develop appropriate adaptation policies for selfadaptive systems, developers usually have to accomplish two main tasks: (i) identify the application-level constraints that regulate the desired  ...  An SMT solver searches possible interpretations for the functions, satisfying all the constraints. Figure 4 shows a sample SMT instance. It is divided in three parts.  ... 
doi:10.1007/978-3-319-11653-2_17 fatcat:nofdikincrfqhlj77wwlgh5j74

The Strategy Challenge in SMT Solving [chapter]

Leonardo de Moura, Grant Olney Passmore
2013 Lecture Notes in Computer Science  
While these heuristic combinations tend to be highly tuned for known classes of problems, they may easily perform badly on classes of problems not anticipated by solver developers.  ...  We present a challenge to the SMT community: to develop methods through which users can exert strategic control over core heuristic aspects of SMT solvers.  ...  Jackson, Joost Joosten and Larry Paulson for helpful comments on a draft of this paper. We thank the referees for their many useful corrections and suggestions.  ... 
doi:10.1007/978-3-642-36675-8_2 fatcat:op5iarzvnvfkddz5ycsgyzo264

Theory Exploration Powered by Deductive Synthesis [chapter]

Eytan Singher, Shachar Itzhaky
2021 Lecture Notes in Computer Science  
AbstractThis paper presents a symbolic method for automatic theorem generation based on deductive inference.  ...  Our approach introduces a new method for using abstraction to overcome the above limitations, combining it with deductive synthesis to reason about abstract values.  ...  linear integer arithmetic in SMT solvers.  ... 
doi:10.1007/978-3-030-81688-9_6 fatcat:6nzwbykqofftlciqg453veclia
« Previous Showing results 1 — 15 out of 348 results