News for hackers. Stuff that matters.

A comment on Hardening attack surfaces with formally proven binary format parsers. Parent comment

Re:Hardening attack surfaces with formally proven binary for... by UncleMeat on Tuesday July 05, 2022 @11:53AM (#31989769)
It wouldn’t break Rice’s Thm to prove it for a particular program. All Rice’s Thm says is that any algorithm must fail on some programs.
[ Parent | on HN ]
Re:Hardening attack surfaces with formally proven binary for... by staticassertion on Tuesday July 05, 2022 @09:27PM (#31995775)
It would if you're talking about arbitrary classes of bugs.
[ Parent | on HN ]
Re:Hardening attack surfaces with formally proven binary for... by UncleMeat on Tuesday July 05, 2022 @09:56PM (#31995929)
Not so. Consider the algorithm that reports "Yes" for all inputs for all program properties. For a large number of programs and properties, this algorithm will report the correct information.
[ Parent | on HN ]