<?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=WG22%2FM15SolarLezama</id>
	<title>WG22/M15SolarLezama - 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=WG22%2FM15SolarLezama"/>
	<link rel="alternate" type="text/html" href="http://mw.hh.se/wg211/index.php?title=WG22/M15SolarLezama&amp;action=history"/>
	<updated>2026-04-05T20:58:42Z</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=WG22/M15SolarLezama&amp;diff=1323&amp;oldid=prev</id>
		<title>Eric: Created page with &quot;Interactive derivation of provably correct divide-and-conquer dynamic programming implementations  In this talk I will describe a new approach to deductive synthesis based on &#039;so...&quot;</title>
		<link rel="alternate" type="text/html" href="http://mw.hh.se/wg211/index.php?title=WG22/M15SolarLezama&amp;diff=1323&amp;oldid=prev"/>
		<updated>2015-10-26T01:44:07Z</updated>

		<summary type="html">&lt;p&gt;Created page with &amp;quot;Interactive derivation of provably correct divide-and-conquer dynamic programming implementations  In this talk I will describe a new approach to deductive synthesis based on &amp;#039;so...&amp;quot;&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;Interactive derivation of provably correct divide-and-conquer dynamic programming implementations&lt;br /&gt;
&lt;br /&gt;
In this talk I will describe a new approach to deductive synthesis based on &amp;#039;solver-aided tactics&amp;#039; that combines the benefits of traditional deductive program derivation techniques with the strengths of constraint-based synthesis. We have applied this approach to the generation of complex divide-and-conquer implementations of dynamic programming algorithms. Divide-and-conquer implementations have been shown to have better locality and parallelism than traditional loop-based implementations, but they are difficult and error prone to construct by hand. The talk will show how our system based on solver-aided-tactics can support the derivation of provably correct implementations of these algorithms with only a small amount of user interaction.&lt;/div&gt;</summary>
		<author><name>Eric</name></author>
	</entry>
</feed>