2 ms·
They try to find a counter-example to the constraints you have set up, or tell you that no such counter-example exists, in which case your program is correct. T
by IshKebab 3y ago
They try to find a counter-example to the constraints you have set up, or tell you that no such counter-example exists, in which case your program is correct. The counter-example is in the form of inputs to your program or function.
It looks like the TLA+ Proof System does the same thing, but I believe you can also use TLA+ in "brute force all the states" mode. I haven't actually used it.