[PDF][PDF] Search-based program synthesis
Search-based program synthesis Page 1 84 COMMUNICATIONS OF THE ACM | DECEMBER
2018 | VOL. 61 | NO. 12 review articles Writing programs that are both correct and efficient is …
2018 | VOL. 61 | NO. 12 review articles Writing programs that are both correct and efficient is …
[ספר][B] Syntax-guided synthesis
R Alur, R Bodik, G Juniwal, MMK Martin… - 2013 - ieeexplore.ieee.org
The classical formulation of the program-synthesis problem is to find a program that meets a
correctness specification given as a logical formula. Recent work on program synthesis and …
correctness specification given as a logical formula. Recent work on program synthesis and …
Faster, higher, stronger: E 2.3
E 2.3 is a theorem prover for many-sorted first-order logic with equality. We describe the
basic logical and software architecture of the system, as well as core features of the …
basic logical and software architecture of the system, as well as core features of the …
Reliable benchmarking: requirements and solutions
Benchmarking is a widely used method in experimental computer science, in particular, for
the comparative evaluation of tools and algorithms. As a consequence, a number of …
the comparative evaluation of tools and algorithms. As a consequence, a number of …
Learning rate based branching heuristic for SAT solvers
In this paper, we propose a framework for viewing solver branching heuristics as
optimization algorithms where the objective is to maximize the learning rate, defined as the …
optimization algorithms where the objective is to maximize the learning rate, defined as the …
Scaling enumerative program synthesis via divide and conquer
Given a semantic constraint specified by a logical formula, and a syntactic constraint
specified by a context-free grammar, the Syntax-Guided Synthesis (SyGuS) problem is to …
specified by a context-free grammar, the Syntax-Guided Synthesis (SyGuS) problem is to …
Step** stones in the TPTP world
The TPTP World is a well established infrastructure that supports research, development,
and deployment of Automated Theorem Proving (ATP) systems. There are key components …
and deployment of Automated Theorem Proving (ATP) systems. There are key components …
Counterexample-guided quantifier instantiation for synthesis in SMT
We introduce the first program synthesis engine implemented inside an SMT solver. We
present an approach that extracts solution functions from unsatisfiability proofs of the …
present an approach that extracts solution functions from unsatisfiability proofs of the …
[PDF][PDF] Software Testing: 5th Comparative Evaluation: Test-Comp 2023.
The 5th edition of the Competition on Software Testing (Test-Comp 2023) provides again an
overview and comparative evaluation of automatic test-suite generators for C programs. The …
overview and comparative evaluation of automatic test-suite generators for C programs. The …
The termination and complexity competition
The termination and complexity competition (termCOMP) focuses on automated termination
and complexity analysis for various kinds of programming paradigms, including categories …
and complexity analysis for various kinds of programming paradigms, including categories …