Hardening attack surfaces with formally proven binary format parsers

Re:Hardening attack surfaces with formally proven binary for... by staticassertion on Tuesday July 05, 2022 @01:09AM (#31984543)

It means that a program has been verified against a model, and properties of that model are held true.

What it does not mean is that the program is bug free. That would, of course, violate the halting problem, or its generalization Rice's Theorem - non-trivial programs can not have arbitrary properties proven about them.

There's also Gödel's Incompleteness Theorem, obviously, as well as the fact that a proof is only as good as its model.

[ Parent | on HN ]

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 ]

Re:Hardening attack surfaces with formally proven binary for... by mbrodersen on Tuesday July 05, 2022 @09:19PM (#31995728)

Not true for non-Turing complete languages. Which is why all proof tools require a proof of termination. Some do it automatically (essential ruling out Turing complete languages) others require a formal proof of termination by the user.

[ Parent | on HN ]