Standard fixpoint iteration for Java bytecode verification

ACM Transactions on Programming Languages and Systems

Volumn 22, Issue 4, 2000, Pages 638-672

  Qian, Zhenyu ^a  

^a KESTREL INSTITUTE   (United States)

Author keywords

Algorithms; Bytecode verification; D.3.1 Programming Languages : Formal Definitions and Theory; Dataflow analysis; Fixpoint; Java; Languages

Indexed keywords

EID: 0001362437     PISSN: 01640925     EISSN: None     Source Type: Journal    
DOI: 10.1145/363911.363915     Document Type: Article

References (27)

1. BERTELSEN, P. 1997. Semantics of Java byte code. Available under ftp://ftp.dina.kvl.dk/pub/Staff/Peter.Bertelsen/jvm-semantics.ps.gz.
2. BÖRGER, E. AND SCHULTE, W. 1999. Modular design for the Java virtual machine architecture. ftp://ftp.di.unipi.it/pub/Papers/boerger/jvmarch.ps.
3. COGLIO, A., GOLDBERG, A., AND QIAN, Z. 1998. Towards a provably-correct implementation of the JVM bytecode verifier. In Proc. OOPSLA'98 Workshop Formal Underpinnings of Java. IEEE Computer Society Press.
4. COHEN, R. 1997. The Defensive Java Virtual Machine specification. Tech. rep., Computational Logic inc.
5. COUSOT, P. AND COUSOT, R. 1977. Abstract interpretation: a unified lattice model for static analysis of programs by construction of approximation of fixpoints. In Proc. 4th ACM Symp. Principles of Programming Languages. ACM, New York, 238-258.
6. COUSOT, P. AND COUSOT, R. 1979. Constructive versions of Tarski's fixed point theorems. Pacific Journal of Mathematics 82, 1, 43-57.
7. FREUND, S. AND MITCHELL, J. 1998. A type system for object initialization in the Java bytecode language. In Proc. ACM Conf. on Object-Oriented Programming, Systems, Languages, and Applications. ACM, New York, 310-328.
8. FREUND, S. AND MITCHELL, J. 1999a. A formal framework for the Java bytecode language and verifier. In Proc. ACM Conf. on Object-Oriented Programming, Systems, Languages, and Applications. ACM, New York, 147-166.
9. FREUND, S. AND MITCHELL, J. 1999b. Specification and verification of Java bytecode subroutines and exceptions. Tech. rep., Computer Science Department, Stanford University.
10. GESER, A., KNOOP, J., LÜTTGEN, G., RÜTHING, O., AND STEFFEN, B. 1996. Non-monotone fixtpoint iterations to resolve second order effects. In Proc. 6th Int. Conf. on Compiler Construction. Springer-Verlag LNCS 1060, 106-120.
11. GOLDBERG, A. 1998. A specification of Java loading and bytecode verification. In Proc. 5th ACM Conference on Computer and Communications Security. ACM, New York.
12. HAGIYA, M. AND TOZAWA, A. 1998. On a new method for dataflow analysis of Java Virtual Machine subroutines. In Proc. 1998 Static Analysis Symposium. Springer-Verlag LNCS.
13. JONES, M. 1998. The functions of Java bytecode. In Proc. OOPSLA'98 Workshop Formal Underpinnings of Java.
14. KILDALL, G. 1973. A unified approach to global program optimization. In Proc. ACM Symp. Principles of Programming Languages. ACM, New York.
15. LASSEZ, J.-L., NGUYEN, V., AND SONNENBERG, E. 1982. Fixed point theorems and semantics: A folk tale. Information Processing Letters 14, 3, 112-116.
16. LINDHOLM, T. AND YELLIN, F. 1996. The Java Virtual Machine Specification. Addison-Wesley.
17. MORRISETT, G., CRARY, K., GLEW, N., AND WALKER, D. 1998. Stack-based typed assembly language. In ACM Workshop for Types in Compilation.
18. MORRISETT, G., WALKER, D., CRARY, K., AND GLEW, N. 1998. From system F to typed assembly language. In Proc. 25nd ACM Symp. Principles of Programming Languages. ACM, New York, 85-97.
19. MUCHNICK, S. 1997. Advanced Compiler Design and Implementation. Morgan Kaufmann, San Francisco.
20. NIPKOW, T. 2000. Verified bytecode verifiers. Tech. rep., Technische Universität München. http://www.in.tum.de/nipkow/pubs/bcv2.html.
21. O'CALLAHAN, R. 1999a. Private communication.
22. O'CALLAHAN, R. 1999b. A simple, comprehensive type system for Java bytecode subroutines. In Proc. 26th ACM Symp. Principles of Programming Languages. ACM, New York, 70-78.
23. PUSCH, C. 1999. Proving the soundness of a Java bytecode verifier specification in Isabelle/HOL. In Proc. 1999 Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS '99). LNCS, vol. 1579. Springer-Verlag, 89-103.
24. QIAN, Z. 1998. A formal specification of Java virtual machine instructions for objects, methods and subroutines. In Formal Syntax and Semantics of Java, J. Alves-Foss, Ed. LNCS, vol. 1523. Springer-Verlag.
25. SMOLKA, G., NUTT, W., GOGUEN, J., AND MESEGUER, J. 1989. Order-sorted equational computation. In Resolution of Equations in Algebraic Structures, volume 2, H. Aït-Kaci and M. Nivat, Eds. Academic Press, 297-367.
26. STATA, R. AND ABADI, M. 1998. A type system for Java bytecode subroutines. In Proc. 25th ACM Symp. Principles of Programming Languages. ACM, New York.
27. YELLAND, P. 1999. A compositional account of the Java Virtual Machine. In Proc. 26th ACM Symp. Principles of Programming Languages. ACM, New York, 70-78.