2 ms·
> "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
by Animats 3y ago
> "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.