http://mw.hh.se/wg211/index.php?action=history&feed=atom&title=WG211%2FM2Taha 2026-04-05T20:57:51Z Revision history for this page on the wiki MediaWiki 1.43.5 http://mw.hh.se/wg211/index.php?title=WG211/M2Taha&diff=113&oldid=prev 2011-12-12T10:06:25Z

<p>1 revision</p> <p><b>New page</b></p><div>[[Category:WG211]]<br /> <br /> <br /> Title:<br /> Regenerative Programming: A New Approach to Data Mining for Software Design&lt;BR&gt;<br /> Walid Taha<br /> <br /> Abstract:<br /> While there are many concrete examples of how program generation helps, we do not yet have a general theory for explaining these various concrete examples. At the same time, a key impediment in the adoption of software generation technology is that it often requires software developers to learn new languages (which are also often domain-specific). To address the first point, we propose the use of Kolmogorov complexity as a basis for explaining some of the basic qualities of program generation. To address the second point, and to provide an effective path for the adoption of program generation, we propose a new approach to managing large software systems, and which can be described as Regenerative Programming (RP). The technical novelty in this approach lies in automatically extracting a program generator capable of exactly reconstructing the full code base. To illustrate the potential of this approach, we propose, implement, and test a basic algorithm extracting such generators. Preliminary experimental results on various benchmarks (including the Linux kernel) are encouraging.<br /> <br /> This work suggests that there can be significant benefit from viewing program generators as a device to capture the content of a computation both concisely and precisely without incurring an additional runtime overhead.</div>

Admin