https://hackerpaper.kaipfister.de/p/1105.2576/Collected HN comments and submissions linking this paper.enMon, 02 Nov 2026 11:16:22 GMThttps://news.ycombinator.com/item?id=14659233urn:hackerpapers:mention:1105.2576:14659233Wed, 28 Jun 2017 22:48:25 GMT<p>On top of that, we even have some that are formally verified or validating that could be tied into Rust. https://arxiv.org/pdf/1105.2576.pdf http://gallium.inria.fr/~xleroy/publi/validated-parser.pdf http://users.cecs.anu.edu.au/~aditi/esop09_submission_16.pdf One of those handled most of C99 standard.</p><p><a href="https://hackerpaper.kaipfister.de/p/1105.2576/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.LOhttps://news.ycombinator.com/item?id=13730536urn:hackerpapers:mention:1105.2576:13730536Sat, 25 Feb 2017 07:43:05 GMT<p>Next time, beware of parsers. Or formally verify them :) https://arxiv.org/pdf/1105.2576.pdf (disclaimer: co-author)</p><p><a href="https://hackerpaper.kaipfister.de/p/1105.2576/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.LOhttps://news.ycombinator.com/item?id=11977331urn:hackerpapers:mention:1105.2576:11977331Sat, 25 Jun 2016 18:17:50 GMT<p>Appreciate the feedback. My plan was to push some formal methodists or LANGSEC types to try to do a verified GLL if the opportunity arises. So far, there&#x27;s been SLR [1], LR(1) [2], and PEG [3] verified for correctness. Think verified GLL generator is ideal next target given benefits? [1] http://users.cecs.anu.edu.au/~aditi/esop.pdf [2] http://pauillac.inria.fr/~xleroy/publi/validated-parser.pdf [3] https://arxiv.org/pdf/1105.2576.pdf</p><p><a href="https://hackerpaper.kaipfister.de/p/1105.2576/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.LOhttps://news.ycombinator.com/item?id=9949662urn:hackerpapers:mention:1105.2576:9949662Sun, 26 Jul 2015 00:50:24 GMT<p>Great work by the LANGSEC crowd. My recent interest in parsers was those verified for correctness or security. So, they have security and a certain amount of correctness. A great next step would be combining it with work on formal verification of parsers or generators (see below). On top of that, ensure the subset could generate SPARK and/or CompCert-compatible C code to automate much of the rest of the problem. TRX formally verified parser interpreter http://arxiv.org/pdf/1105.2576.pdf Validating LR(1) Parsers http://gallium.inria.fr/~xleroy/publi/validated-parser.pdf Verifying a parser for…</p><p><a href="https://hackerpaper.kaipfister.de/p/1105.2576/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.LO