Formal Verification Creates Hacker-Proof Code

Re:Formal Verification Creates Hacker-Proof Code by pfortuny on Friday October 21, 2016 @01:00PM (#12762192)

Mmmhhhh.... Arithmetic in computers is bot infinite, so one might have a consistence theorem for "computers with arithmetic modulo 2^3000" for example.

[ Parent | on HN ]

Re:Formal Verification Creates Hacker-Proof Code by schoen on Friday October 21, 2016 @06:15PM (#12765383)

Your exponent is a bit too small, though; it should be 2^(number of bits of RAM), like 2^34359738368 for a computer with 4 GB RAM (plus a little bit for CPU registers).

Assuming that the computer programs under study aren't allowed to interact with a disk, of course. :-)

[ Parent | on HN ]

Re:Formal Verification Creates Hacker-Proof Code by aruggirello on Saturday October 22, 2016 @05:39AM (#12768021)

Or with the Internet :-D

[ Parent | on HN ]