Hagiya, M. and A. Tozawa. On a New Method fot Dataflow Analysis of Java Virtual Machine. In, Proceedings of the  Home/Search   Document Not in Database   Summary   Related Articles   Check

....Qian [3] presented a constraint based typing system for objects, primitive values, methods and subroutines and proved the soundness. Freund and Mitchell [16] made a significant extension of Stata and Abadi s type system [11] by considering object initialization. Hagiya and Tozawa [12] presented another type system for subroutines, where the soundness proof is extremely simple. Hagiya and Tozawa discussed issues relating to implementation of their type system, but they did not formally describe their implementation. In fact, since they did not consider objects, their ....

Hagiya, M. and A. Tozawa. On a New Method fot Dataflow Analysis of Java Virtual Machine. In, Proceedings of the

....about subroutines. Freund and Mitchell [2] made a significant extension of Stata and Abadi s type system by considering object initialization. Qian [8] presented a constraint based typing system for objects, primitive values, methods and subroutines and proved the soundness. Hagiya and Tozawa [4] presented another type system for subroutines, where the soundness proof is extremely simple. Pusch [7] formalized a subset of JVM in the theorem prover Isabelle HOL and reached a higher degree of reliability. Recently, O Callahan [6] proposed yet another typing system based on type constraints, ....

....another typing system based on type constraints, polymorphic recursion and continuations. All this work basically aimed at defining what types memory locations should have, did not consider how to develop a provably correct implementation to compute types for memory locations. Hagiya and Tozawa [4] discussed issues on an implementation of their type system, but did not formally describe the implementation. In addition, since they did not consider objects, their implementation may not encounter the problems we have here. Goldberg [3] directly used dataflow analysis to formally specify ....

M. Hagiya and A. Tozawa. On a new method fot dataflow analysis of Java Virtual Machine subroutines. In Proc. 1998 Static Analysis Symposium. Springer-Verlag LNCS, 1998.

....proposed a type system for subroutines, provided lengthy proofs for the soundness of the system and clarified several key semantic issues about subroutines. Freund and Mitchell [5] made a significant extension of Stata and Abadi s type system by considering object initialization. Hagiya and Tozawa [8] presented another type system for subroutines, where the soundness proof is extremely simple. Qian [13] presented a constraint based typing system for objects, primitive values, methods and subroutines and proved the soundness. Pusch [12] formalized a subset of JVM in the theorem prover ....

M. Hagiya and A. Tozawa. On a new method fot dataflow analysis of Java Virtual Machine subroutines. In Proc. 1998 Static Analysis Symposium. SpringerVerlag LNCS, 1998. To appear.

....a type system for subroutines, provided lengthy proofs for the soundness of the system and clarified several key semantic issues about subroutines. Freund and Mitchell [FM98] made a significant extension of Stata and Abadi s type system by considering object initialization. Hagiya and Tozawa [HT98] presented another type system for subroutines, where the soundness proof is extremely simple. Qian [Qia98] presented a constraint based typing system for objects, primitive values, methods and subroutines and proved the soundness. Pusch [Pus98] formalized a subset of the JVM in the theorem prover ....

Masami Hagiya and Akihiko Tozawa. On a new method fot dataflow analysis of Java Virtual Machine subroutines. In Proc. 1998 Static Analysis Symposium. Springer-Verlag LNCS, 1998. To appear.

....does. Goldberg gave a formal specification of bytecode verification [7] Compared with our work, he considered array types, but not subroutines. In addition, his formal specification is a dataflow analysis and thus closer to the implementation. Hagiya presented another type system for subroutines [9]. One of the interesting points in his approach is to introduce a mechanism to distinguish the so called used from the unused data in a subroutine. His idea is to use a kind of special types indicating that a certain memory location in a subroutine always has the same content as a memory ....

M. Hagiya. On a new method fot dataflow analysis of Java Virtual Machine subroutines. 1998.

....a type system for subroutines, provided lengthy proofs for the soundness of the system and clarified several key semantic issues about subroutines. Freund and Mitchell [FM98] made a significant extension of Stata and Abadi s type system by considering object initialization. Hagiya and Tozawa [HT98] presented another type system for subroutines, where the soundness proof is extremely simple. Qian [Qia98] presented a constraint based typing system for objects, primitive values, methods and subroutines and proved the soundness. Pusch [Pus98] formalized a subset of the JVM in the theorem prover ....

Masami Hagiya and Akihiko Tozawa. On a new method fot dataflow analysis of Java Virtual Machine subroutines. In Proc. 1998 Static Analysis Symposium. Springer-Verlag LNCS, 1998. To appear.

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