> >The KVM of Java includes pre-verify info, which serves similar purpose. The > >reason behind is Java bytecode verification is (kind of) NP-complete. By > >using pre-verify info, the problem can be reduced to linear in most case. (No one > >prove it mathmatically, but you got the idea.) > > Hmmm. Can you trust it? Seems like it wouldn't help drop the time, > since you'd need to verify the pre-verify info, though I suppose > verifying the information might be faster than constructing it from > the bytecode.
No, I don't trust it. But I can easily verify it. It is just like public key algorithm. Factoring a real big number is a pain, but verify whether the (a * b) == c is piece of cake. I don't search for the answer , I just verify your answer. Hong
