<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>External Behavior of a Logic Program and Verification of Refactoring · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2305.17485/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:27:26 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2305.17485/feed.xml" rel="self" type="application/rss+xml" /><item><title>External Behavior of a Logic Program and Verification of Refactoring — HN submission</title><link>https://news.ycombinator.com/item?id=41439259</link><guid isPermaLink="false">urn:hackerpapers:submission:2305.17485:41439259</guid><pubDate>Tue, 03 Sep 2024 21:11:48 GMT</pubDate><description>&lt;p&gt;Help Finding LLM and Proof Based Refactoring Reference&lt;/p&gt;&lt;p&gt;Recently on HN I came across an LLM paper achieving impressive results on SWE-bench refactoring tasks. In addition to generating the refactoring, it also created a formal proof of equivalence in a special DSL. Now I can&amp;#x27;t seem to find the paper! So far, I have scrubbed the HN SWE-bench articles from the last 9 months, and tried Google scholar searches for LLM based refactoring with Proofs or DSLs. I am confident that they mention SWE-bench in the abstract, but it does not seem to be mentioned in the HN announcement. I don&amp;#x27;t remember if it was a custom DSL, or if they used a well known…&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2305.17485/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.LO</category></item></channel></rss>
