> Proving that the code is correct is the hard part (np-complete), but a
> user-level problem. But if I remember correctly, it is possible to
> automate the process for limited problems such as packet-filters.
Verifying of algorithms is not NP complete as it isn't even algorithmically
solvable (as a subtask, you need to solve the Halting problem).
Have a nice fortnight
-- Martin `MJ' Mares <mj@ucw.cz> http://atrey.karlin.mff.cuni.cz/~mj/ Faculty of Math and Physics, Charles University, Prague, Czech Rep., Earth "Whoa...I did a 'cp /vmlinuz >/dev/audio' and I think I heard God..."- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.rutgers.edu Please read the FAQ at http://www.altern.org/andrebalsa/doc/lkml-faq.html