Opening book details…
Can I read Combinatorial Sketching for Finite Programs on EtoBox?
Combinatorial Sketching for Finite Programs by Armando Solar-Lezama; Liviu Tancau; Rastislav Bodik; Sanjit Seshia; Vijay Saraswat is a Computer Science article available to read on EtoBox.
What is Combinatorial Sketching for Finite Programs about?
Sketching is a software synthesis approach where the programmer develops a partial implementation - a sketch - and a separate specification of the desired functionality. The synthesizer then completes the sketch to behave like the specification. The correctness of the synthesized implementation is guaranteed by the compiler, which allows, among other benefits, rapid development of highly tuned implementations without the fear of introducing bugs.We develop SKETCH, a language for finite programs with linguistic support for sketching. Finite programs include many highperformance kernels, including cryptocodes. In contrast to prior synthesizers, which had to be equipped with domain-specific rules, SKETCH completes sketches by means of a combinatorial search based on generalized boolean satisfiability. Consequently, our combinatorial synthesizer is complete for the class of finite programs: it is guaranteed to complete any sketch in theory, and in practice has scaled to realistic programming problems.Freed from domain rules, we can now write sketches as simpleto-understand partial programs, which are regular programs in which difficult code fragments are replaced with __holes__ to be f
Who reads Combinatorial Sketching for Finite Programs?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- Armando Solar-Lezama; Liviu Tancau; Rastislav Bodik; Sanjit Seshia; Vijay Saraswat
- Publisher
- ACM
- Published
- 2006
- Language
- EN
- Field
- Computer Science (Physical Sciences)