<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Automated Clustering and Program Repair for Introductory Programming Assignments · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1603.03165/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1603.03165/feed.xml" rel="self" type="application/rss+xml" /><item><title>Automated Clustering and Program Repair for Introductory Programming Assignments — mentioned by rbodik</title><link>https://news.ycombinator.com/item?id=20782858</link><guid isPermaLink="false">urn:hackerpapers:mention:1603.03165:20782858</guid><pubDate>Fri, 23 Aug 2019 21:36:03 GMT</pubDate><description>&lt;p&gt;Hi Athanasios, program synthesis has been used to automatically repair introductory programming assignments (a sample of papers is at the end). This technology could make tutors more productive: [1] says that 81% of synthesized repairs were of high quality. This is very impressive but the tutor is still needed to check the quality. Also, synthesis cannot repair all programs (an empty submission cannot be repaired). Finally, this automatic repair allows the tutor to focus on giving guidance, rather than on finding the bug in a programming assignment. [1] https://arxiv.org/pdf/1603.03165.pdf…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1603.03165/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.PL</category></item></channel></rss>
