2 ms·
That state machine looks ahead more than one symbol and has a lot of memory even if you consider it one big state. You have to verify it decodes invalid instru
by mhh__ 6y ago
That state machine looks ahead more than one symbol and has a lot of memory even if you consider it one big state.
You have to verify it decodes invalid instructions as a fault which means testing the entire search space.
Hypothetically you could use a bounded model check but you need to test roughly 10^36 combinations which is still thousands of years if you can do a 1000 billion billion a second. You need a formal proof of the operation too.
- dragontamer 6y agoYou 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.