News for hackers. Stuff that matters.
Re:Some notes on Rust, mutable aliasing and formal verification by Animats on Thursday May 16, 2024 @06:08AM (#40376730)
> "try to generate a counter-example from here" For the theories behind some SAT solvers, that's quite possible. There's a set of problems that are completely decidable. These are composed of add, subtract, multiply by constants, logic operators, and theory of arrays and structs. That covers most things which cause programs to crash and many of the things you want to write in assertions.

There are no comments on this comment yet.