<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A case study in formal verification of a Java program · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1809.03162/</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/1809.03162/feed.xml" rel="self" type="application/rss+xml" /><item><title>A case study in formal verification of a Java program — mentioned by Viliam1234</title><link>https://news.ycombinator.com/item?id=23707917</link><guid isPermaLink="false">urn:hackerpapers:mention:1809.03162:23707917</guid><pubDate>Wed, 01 Jul 2020 23:09:06 GMT</pubDate><description>&lt;p&gt;Maybe this is just my ignorance speaking, but I think that using formal methods would take a lot of time; more than the projects I am working on are worth. Also, I don&amp;#x27;t know how to do it. I mean, at school we had some examples, but those were for math-like stuff (how to verify that the algorithm calculating the square root actually calculates the square root), but I wouldn&amp;#x27;t know how to apply that to programs that are mostly reading something from database and displaying it on a web page. Now that I googled a bit, I found a paper https://arxiv.org/abs/1809.03162 claiming that &amp;quot;Tools for…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1809.03162/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.LO</category></item></channel></rss>
