Philip W. L. Fong and Robert D. Cameron. Proof linking: An architecture for modular veri cation of dynamically-linked mobile code. In Proceedings of the Sixth ACM SIGSOFT International Symposium on the Foundations of Software Engineering (FSE'98), Orlando, Florida, November 1998. Also available at http://www.cs.sfu.ca/ pwfong/personal/Pub/fse98.ps.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....overlap with the bugs reported in this paper. The common bugs were discovered and reported independently. Our idea of having a self contained bytecode veri er that generates subtype constraints nds its roots in earlier work by Goldberg [3] and is similar in spirit to Fong and Cameron s work [2]. However, both papers do not consider multiple class loaders. Another di erence is that in those formalizations the bytecode veri er generates, besides subtype constraints, additional constraints, e.g. for elds and methods referenced in the code being veri ed. In the design proposed in this ....

Philip W. L. Fong and Robert D. Cameron. Proof linking: An architecture for modular verication of dynamically-linked mobile code. ACM SIGSOFT Software Engineering Notes, 23(6):222-230, November 1998. Proceedings of the ACM SIGSOFT Sixth International Symposium on the Foundations of Software Engineering.

....claims, or see where the problems are and how they are solved. This solution is also documented in [15] A good informal account of class loading can be found in [11] However, that account often does not distinguish between the JDK 1.2 implementation and the JVM speci cation. Fong and Cameron [7] proposed a general, modular architecture for mobilecode loading and veri cation, and discussed a possible instantiation for Java loading and bytecode veri cation. In particular, their concept of proof obligations corresponds to our concepts of constraints. However, they do not consider multiple ....

P. Fong and R. Cameron. Proof linking: An architecture for modular verication of dynamically-linked mobile code. In Proc. 6th ACM SIGSOFT Int. Symp. on the Foundations of Software Engineering (FSE'98), 1998.

....the operational semantics of a simpli ed JVM that includes class loading, resolution, bytecode veri cation, and execution of some instructions, and we prove type safety results about it. Our approach of having a self contained bytecode veri er that generates constraints is similar in spirit to [3]. However, they do not consider multiple class loaders. Their bytecode veri er generates, besides subtype constraints, several other kinds of constraints, e.g. for elds and methods referenced in the code being veri ed. We only generate subtype constraints because the others can be checked at ....

Philip W. L. Fong and Robert D. Cameron. Proof linking: An architecture for modular verication of dynamically-linked mobile code. ACM SIGSOFT Software Engineering Notes, 23(6):222-230, November 1998. Proceedings of the ACM SIGSOFT Sixth International Symposium on the Foundations of Software Engineering.

....claims, or see where the problems are and how they are solved. This solution is also documented in [16] A good informal account of class loading can be found in [12] However, that account often does not distinguish between the JDK 1.2 implementation and the JVM speci cation. Fong and Cameron [8] proposed a general, modular architecture for mobile code loading and veri cation, and discussed a possible instantiation for Java loading and bytecode veri cation. In particular, their concept of proof obligations corresponds to our concepts of constraints. However, they do not consider multiple ....

P. Fong and R. Cameron. Proof linking: An architecture for modular verication of dynamically-linked mobile code. In Proc. 6th ACM SIGSOFT Int. Symp. on the Foundations of Software Engineering (FSE'98), 1998.

.... be properly instantiated to handle Java bytecode veri cation in the presence of Java s lazy, dynamic linking process 22 To address this research problem, the Proof Linking architecture was instantiated to handle bytecode veri cation in the context of a Java speci c dynamic linking model [24, 25]: The mentioned temporal dependencies were captured in a relatively lazy linking strategy. A set of relevant proof obligations and commitments was designed to capture the veri cation interface of Java bytecode veri cation. This instantiation of Proof Linking was formally proven to ....

....proposal and an updated version of my depth exam survey paper. Jan 31, 2003 Implementation. Finish with the implementation of support for distributed veri cation in Aegis VM. Writing. Finish with the writing up of dissertation chapters 4 5, roughly corresponding to the work reported in [24, 25, 26] concerning the modeling adequacy and theoretical soundness of the Proof Linking architecture. Feb 28, 2003 Implementation. Finish with the implementation of an open proof linking mechanism, and testing the mechanism by realizing read only types in the JVM. May 31, 2003 Writing. Finish with ....

Philip W. L. Fong and Robert D. Cameron. Proof linking: An architecture for modular veri cation of dynamically-linked mobile code. In Proceedings of the Sixth ACM SIGSOFT International Symposium on the Foundations of Software Engineering (FSE'98), Orlando, Florida, November 1998. Also available at http://www.cs.sfu.ca/ pwfong/personal/Pub/fse98.ps.

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