<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Petri Nets-based Methods on Automatically Detecting for Concurrency Bugs in Rust Programs · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2212.02754/</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/2212.02754/feed.xml" rel="self" type="application/rss+xml" /><item><title>Petri Nets-based Methods on Automatically Detecting for Concurrency Bugs in Rust Programs — mentioned by nyrikki</title><link>https://news.ycombinator.com/item?id=47356408</link><guid isPermaLink="false">urn:hackerpapers:mention:2212.02754:47356408</guid><pubDate>Thu, 12 Mar 2026 20:14:49 GMT</pubDate><description>&lt;p&gt;Even with classic compilation, it is only the semantic behavior that is preserved. What the Church–Rosser property/confluence is in term rewriting in lambda calculus is a possible lens. To have a formally verified spec, one has to use some decidable fragment of FO. If you try to replace code generation with rewriting things can get complicated fast.[2] Rust uses affine types as an example and people try to add petri-nets[0] but in general petri-net reachability is Ackerman-complete [1] It is just the trade off of using a context free like system like an LLM with natural language. HoTT and how…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2212.02754/"&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>
