Freund, S. N. and J. C. Mitchell, `A type system for the Java bytecode language and verifier'. Journal of Automated Reasoning. Special issue on bytecode verification (this issue).  Home/Search   Document Details and Download   Summary   Related Articles

....[38, 28, 26] is the closest to the dataflow presentation that we gave above. Other formalizations and correctness proofs of the dataflow approach include those of Qian [44] Coglio et al. [10] and Stark et al. [49] Bytecode verification can also be specified and proved sound using type systems [51, 14, 13]; in this framework, the forward dataflow analysis algorithm that we described can be viewed as a type inference algorithm for these type systems. Hartel and Moreau [21] survey other approaches. 3.3. Interfaces and least upper bounds The dataflow framework presented above requires that the type ....

....Only when one of the initialization methods for its class is invoked on the new object and returns normally is the new object considered fully initialized and usable like any other object. Additional restrictions that we will not discuss here are imposed on initialization methods themselves; see [33, 15, 13]. Unlike the register initialization property, this object initialization property is not crucial to ensure type safety at run time: since the new instruction initializes the instance fields of the new object with correct values for their types, type safety is not broken if the resulting ....

[Article contains additional citation context not shown here]

Freund, S. N. and J. C. Mitchell, `A type system for the Java bytecode language and verifier'. Journal of Automated Reasoning. Special issue on bytecode verification (this issue).

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC