2 ms·
You can prove that an algorithm is correct most of the time (yes, halting and decidability but for practical purposes you mostly can). How do you prove an even
by nottorp 4y ago
You can prove that an algorithm is correct most of the time (yes, halting and decidability but for practical purposes you mostly can).
How do you prove an event driven application is correct?
- Thiez 4y agoModelling your application as a state machine will allow you to use model checking to prove various properties about your model. Proving that your program is equivalent (for some chosen definition of equivalence) to the state machine is left as an exercise for the reader.
- nottorp 4y ago> Proving that your program is equivalent (for some chosen definition of equivalence) to the state machine is left as an exercise for the reader. "It's obvious" :)