3 ms·
It isn't possible to write exhaustive tests - there are an infinite number of possible program states. Well, finite bound by the width of your pointer type, wh
by chrisseaton 10y ago
It isn't possible to write exhaustive tests - there are an infinite number of possible program states.
Well, finite bound by the width of your pointer type, which doesn't help much.
- threatofrain 10y agoCan't some programs be proven to be partially or totally correct?
- chrisseaton 10y agoUsing formal methods? Yes but as an industry we simply don't know how to scale that to something as large and unwieldy as the Ruby VM. And even if we did, correct according to what? There is no mathematical model of the Ruby language to prove it equivalent to (there are a few semantic models for Ruby but they are very limited). And even if we had that, the computational resources needed likely are not available.