Bytecode Model Checking: An Experimental Analysis

Abstract

Java bytecode verification is traditionally performed by a polynomial time data flow algorithm. We investigate an alternative based on reducing bytecode verification to model checking. Despite an exponential worst case time complexity, model checking type-correct bytecode is polynomial in practice when carried out using an explicit state, on the- fly model checker like Spin. We investigate this theoretically and experimentally and explain the practical advantages of this alternative.KeywordsModel CheckTransition SystemSmart CardJava Virtual MachineCorrectness PropertyThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.