Coglio, A.: 2001a, `Improving the O#cial Specification of Java Bytecode Verification'. In: 3rd ECOOP Workshop on Formal Techniques for Java programs. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Java Bytecode Verification: Algorithms and Formalizations - Leroy (2003) (10 citations) (Correct)
....having the same static type C p , thus fooling Sun s verifier into believing that all of them become initialized after invoking an initialization method on one of them. The solution is to prohibit or set to 15 all registers and stack locations that have type C p across a subroutine call. Coglio [9] observes that Sun s restriction on backward branches as well as Freund and Mitchell s restriction on new are unnecessary for a bytecode verifier based on monovariant dataflow analysis. More precisely, 9, section 5.8.2] shows that, in the absence of subroutines, a register or stack location ....
Coglio, A.: 2003, `Improving the O#cial Specification of Java Bytecode Verification '. Concurrency and Computation: Practice and Experience 15(2), 155--179.
Verified Bytecode Subroutines - Klein, Wildmoser (2003) (5 citations) (Correct)
No context found.
Coglio, A.: 2001a, `Improving the O#cial Specification of Java Bytecode Verification'. In: 3rd ECOOP Workshop on Formal Techniques for Java programs.
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