Scaling up superoptimization
Developing a code optimizer is challenging, especially for new, idiosyncratic ISAs.
Superoptimization can, in principle, discover machine-specific optimizations automatically …
Superoptimization can, in principle, discover machine-specific optimizations automatically …
Souper: A synthesizing superoptimizer
R Sasnauskas, Y Chen, P Collingbourne… - arXiv preprint arXiv …, 2017 - arxiv.org
If we can automatically derive compiler optimizations, we might be able to sidestep some of
the substantial engineering challenges involved in creating and maintaining a high-quality …
the substantial engineering challenges involved in creating and maintaining a high-quality …
Satisfiability checking: Theory and applications
Satisfiability checking aims to develop algorithms and tools for checking the satisfiability of
existentially quantified logical formulas. Besides powerful SAT solvers for solving …
existentially quantified logical formulas. Besides powerful SAT solvers for solving …
Speeding up machine-code synthesis
Machine-code synthesis is the problem of searching for an instruction sequence that
implements a semantic specification, given as a formula in quantifier-free bit-vector logic …
implements a semantic specification, given as a formula in quantifier-free bit-vector logic …
Towards porting operating systems with program synthesis
The end of Moore's Law has ushered in a diversity of hardware not seen in decades.
Operating system (OS)(and system software) portability is accordingly becoming …
Operating system (OS)(and system software) portability is accordingly becoming …
Toward Automatic Operating System Ports via Code Generation and Synthesis
DA Holland - 2020 - dash.harvard.edu
Porting operating systems is expensive. Recent developments in formal specifications of
machine architectures and in program synthesis have made it possible to consider …
machine architectures and in program synthesis have made it possible to consider …
Model-assisted machine-code synthesis
V Srinivasan, A Vartanian, T Reps - Proceedings of the ACM on …, 2017 - dl.acm.org
Binary rewriters are tools that are used to modify the functionality of binaries lacking source
code. Binary rewriters can be used to rewrite binaries for a variety of purposes including …
code. Binary rewriters can be used to rewrite binaries for a variety of purposes including …
Step 0: An idea for automatic OCL benchmark generation
H Wu - … : Applications and Foundations: STAF 2017 Collocated …, 2018 - Springer
Abstract Model Driven Engineering (MDE) is an important software development paradigm.
Within this paradigm, models and constraints are essential components for expressing …
Within this paradigm, models and constraints are essential components for expressing …
[PDF][PDF] Equivalence by Canonicalization for Synthesis-Backed Refactoring
Authors' Contact Information: Justin Lubin, justinlubin@ berkeley. edu, University of
California, Berkeley, Berkeley, California, USA; Jeremy Ferguson, jmfergie@ berkeley. edu …
California, Berkeley, Berkeley, California, USA; Jeremy Ferguson, jmfergie@ berkeley. edu …
Learning guided enumerative synthesis for superoptimization
The field of program synthesis has seen substantial recent progress in new ideas, eg,
program sketching and synthesis modulo pruning, and applications, eg, in program repair …
program sketching and synthesis modulo pruning, and applications, eg, in program repair …