• Corpus ID: 15367621

Extending the Applicability of Sketching

@inproceedings{TancauExtendingTA,
  title={Extending the Applicability of Sketching},
  author={Liviu Tancau and Armando Solar-Lezama and Gilad Arnold}
}
We present four extensions to the SKETCH programming system developed at UC Berkeley: (a) support for floating point numbers; (b) a new circuit-based solver; (c) performing synthesis and verification at two separate levels of granularity; (d) extending solutions of small problems to larger instances. These extensions improve the performance of the system, add new functionality, and address scalability concerns for real-world algorithms. 

Figures and Tables from this paper

Symbolic Proof Generation for Resizing Sketches Gilad Arnold and
We propose an approach for resizing finite implementations generated by the SKETCH synthesis framework. Our solution generates a formal proof of equivalence between size-parameterized versions of a

References

SHOWING 1-4 OF 4 REFERENCES
KIDS: A Semi-Automatic Program Development System
TLDR
This work traces the derivation of an algorithm for enumerating solutions to the k-queens problem and believes that KIDS could be developed to the point that it becomes economical to use for routine programming.
DAG-aware AIG rewriting: a fresh look at combinational logic synthesis
TLDR
Experiments on large industrial benchmarks show that the proposed methodology scales to very large designs and is several orders of magnitude faster than SIS and MVSIS while offering comparable or better quality when measured by the quality of the network after mapping.
A Transformation System for Developing Recursive Programs
A system of rules for transforming programs is described, with the programs in the form of recursion equations. An initially very simple, lucid, and hopefully correct program is transformed into a
Fast inverse square root
  • Fast inverse square root
  • 2003