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 ]
There are no comments on this comment yet.