[BOOK][B] Syntax-guided synthesis
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 …
Automating network heuristic design and analysis
Heuristics are ubiquitous in computer systems. Examples include congestion control,
adaptive bit rate streaming, scheduling, load balancing, and caching. In some domains …
adaptive bit rate streaming, scheduling, load balancing, and caching. In some domains …
mlirSynth: Automatic, Retargetable Program Raising in Multi-Level IR using Program Synthesis
MLIR is an emerging compiler infrastructure for modern hardware, but existing programs
cannot take advantage of MLIR's high-performance compilation if they are described in …
cannot take advantage of MLIR's high-performance compilation if they are described in …
Superfusion: Eliminating Intermediate Data Structures via Inductive Synthesis
R Ji, Y Zhao, N Polikarpova, Y ** Library-Based Synthesis
Constraint-based program synthesis techniques have been widely used in numerous
settings. However, synthesizing programs that use libraries remains a major challenge. To …
settings. However, synthesizing programs that use libraries remains a major challenge. To …
Program lifting using gray-box behavior
Porting specialized application components to new platforms is difficult. This is particularly
true if the components depend on proprietary libraries, or specific hardware. To tackle this …
true if the components depend on proprietary libraries, or specific hardware. To tackle this …
Unrestricted termination and non-termination arguments for bit-vector programs
Proving program termination is typically done by finding a well-founded ranking function for
the program states. Existing termination provers typically find ranking functions using either …
the program states. Existing termination provers typically find ranking functions using either …
Type-directed program synthesis and constraint generation for library portability
Fast numerical libraries have been a cornerstone of scientific computing for decades, but
this comes at a price. Programs may be tied to vendor specific software ecosystems resulting …
this comes at a price. Programs may be tied to vendor specific software ecosystems resulting …
SWAPPER: A framework for automatic generation of formula simplifiers based on conditional rewrite rules
This paper addresses the problem of creating simplifiers for logic formulas based on
conditional term rewriting. In particular, the paper focuses on a program synthesis …
conditional term rewriting. In particular, the paper focuses on a program synthesis …