2 ms·
> proving by manipulating Haskell expressions certainly compares favourably to proving with TLA+ and then translating into Haskell Yes, but you don't prove the
by pron 11y ago
> proving by manipulating Haskell expressions certainly compares favourably to proving with TLA+ and then translating into Haskell
Yes, but you don't prove the same properties with Haskell as with TLA+ (in fact, I think that there is little overlap if any in practice). Most properties proven (well, maybe not proven but satisfactorily verified) with TLA+ (or any other sophisticated verification tool) just can't be proven in Haskell. And, again, I even prefer TLA+ to JPF (which is the tool I've had most experience with) which verifies Java bytecode directly because so far I find it more effective to verify only the core components of the algorithm. Verifying the details is usually a waste of effort (they both make the verification harder -- either harder to prove if you're doing a formal proof, or much longer to run in a model checker -- and they are easy to verify by other, informal means).
- dllthomas 11y agoI've only dipped very shallowly into TLA+ and haven't had time to investigate, but I have been wondering if we can leverage Haskell's type system to make sure we're matching the abstractions we've assumed for TLA+ at a low cognitive overhead.