Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Satisfiability and Synthesis Modulo Oracles   In classic program synthesis algorithms, such as counterexample-guided
inductive synthesis (CEGIS), the algorithms alternate between a synthesis phase
and an oracle (verification) phase. Many synthesis algorithms use a white-box
oracle based on satisfiability modulo theory (SMT) solvers to provide
counterexamples. But what if a white-box oracle is either not available or not
easy to work with? We present a framework for solving a general class of
oracle-guided synthesis problems which we term synthesis modulo oracles. In
this setting, oracles may be black boxes with a query-response interface
defined by the synthesis problem. As a necessary component of this framework,
we also formalize the problem of satisfiability modulo theories and oracles,
and present an algorithm for solving this problem. We implement a prototype
solver for satisfiability and synthesis modulo oracles and demonstrate that, by
using oracles that execute functions not easily modeled in SMT-constraints,
such as recursive functions or oracles that incorporate compilation and
execution of code, SMTO and SyMO are able to solve problems beyond the
abilities of standard SMT and synthesis solvers.

12
The categories of this paper are: nucl-th
2
The categories of this paper are: math
22
The categories of this paper are: chao-dyn
6
The categories of this paper are: astro-ph
28
The categories of this paper are: alg-geom
20
The categories of this paper are: acc-phys
3
The categories of this paper are: physics
9
The categories of this paper are: nlin
30
The categories of this paper are: q-alg
5
The categories of this paper are: gr-qc
4
The categories of this paper are: cond-mat
23
The categories of this paper are: solv-int
11
The categories of this paper are: hep-lat
37
The categories of this paper are: supr-con
33
The categories of this paper are: plasm-ph
24
The categories of this paper are: dg-ga