4 ms·
You can formally verify a finite state machine by simply testing all state-transitions. You don't need to do an exhaustive check of the 2^8^15 all 15-byte comb
by dragontamer 6y ago
You can formally verify a finite state machine by simply testing all state-transitions.
You don't need to do an exhaustive check of the 2^8^15 all 15-byte combinations. You just check all state-transitions of the state machine.
Or to put it another way: you don't need to test all 2^8^15 byte combinations. You just need to check all invalid-instructions that have ONE invalid byte, to prove the attributes of the finite-state-machine.