<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>http://mw.hh.se/wg211/index.php?action=history&amp;feed=atom&amp;title=WG211%2FM7Bodik</id>
	<title>WG211/M7Bodik - Revision history</title>
	<link rel="self" type="application/atom+xml" href="http://mw.hh.se/wg211/index.php?action=history&amp;feed=atom&amp;title=WG211%2FM7Bodik"/>
	<link rel="alternate" type="text/html" href="http://mw.hh.se/wg211/index.php?title=WG211/M7Bodik&amp;action=history"/>
	<updated>2026-04-05T22:43:50Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.43.5</generator>
	<entry>
		<id>http://mw.hh.se/wg211/index.php?title=WG211/M7Bodik&amp;diff=221&amp;oldid=prev</id>
		<title>Admin: 1 revision</title>
		<link rel="alternate" type="text/html" href="http://mw.hh.se/wg211/index.php?title=WG211/M7Bodik&amp;diff=221&amp;oldid=prev"/>
		<updated>2011-12-12T10:06:27Z</updated>

		<summary type="html">&lt;p&gt;1 revision&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;[[Category:WG211]]&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
&amp;lt;h1&amp;gt;Program Synthesis by Sketching&amp;lt;/h1&amp;gt;&lt;br /&gt;
&amp;lt;h3&amp;gt;Rastislav Bodik&amp;lt;/h3&amp;gt;&lt;br /&gt;
&lt;br /&gt;
Software synthesis automatically derives programs that are efficient,&lt;br /&gt;
even surprising, but it requires a domain theory, elusive for many&lt;br /&gt;
applications. Trying to make synthesis accessible, we style the&lt;br /&gt;
synthesizer into a programmer assistant: the programmer writes a partial&lt;br /&gt;
program that elides tricky code fragments and the synthesizer completes&lt;br /&gt;
the program to match a specification. Our hypothesis is that the partial&lt;br /&gt;
program, called a sketch, communicates the programmer insight to the&lt;br /&gt;
synthesizer more naturally than a domain theory.&lt;br /&gt;
&lt;br /&gt;
On the algorithmic side, sketching exploits recent advances in automated&lt;br /&gt;
decision procedures. This talk will show how we turned a program checker&lt;br /&gt;
into a synthesizer with a counterexample-guided inductive synthesis. I&lt;br /&gt;
will also describe the SKETCH language and its linguistic support for&lt;br /&gt;
synthesis and show how we synthesized complex implementations of&lt;br /&gt;
ciphers, scientific codes, and even concurrent lock-free&lt;br /&gt;
data-structures.&lt;br /&gt;
&lt;br /&gt;
Joint work with Armando Solar-Lezama, Chris Jones, Gilad Arnold, Lexin&lt;br /&gt;
Shan, Satish Chandra and many others.&lt;br /&gt;
&lt;br /&gt;
* [[Media:bodik-wg09.ppt | bodik-wg09.ppt ]]: Slides&lt;br /&gt;
&lt;br /&gt;
==File Attachments== &lt;br /&gt;
&lt;br /&gt;
*[[Media:bodik-wg09.ppt | bodik-wg09.ppt]]&lt;/div&gt;</summary>
		<author><name>Admin</name></author>
	</entry>
</feed>