https://hackerpaper.kaipfister.de/p/2408.01909/Collected HN comments and submissions linking this paper.enThu, 05 Nov 2026 05:34:29 GMThttps://news.ycombinator.com/item?id=50375318urn:hackerpapers:mention:2408.01909:50375318Thu, 05 Nov 2026 04:48:13 GMT<p>No, that&#x27;s not how to look at it. Obviously &quot;all function calls&quot; phrase cannot be absolute, but most can be caught with the analyzer giving one of proved/disproved/unknown result. The reason all cannot be caught is because pre/post are logical predicates on sets of values and are not part of the typing system. To understand that, you have to know how a static analyzer works and specifically two of its functions, &quot;Data Flow Analysis&quot; and &quot;Symbolic Execution&quot;. It is Symbolic Execution that does static checking without the need for the actual runtime values to be known. It basically &quot;executes&quot;…</p><p><a href="https://hackerpaper.kaipfister.de/p/2408.01909/">Paper and discussion history</a>. A mention is not an endorsement.</p>cs.SE