Skip to main content
SpringerLink
Log in

Verified Bytecode Subroutines

  • Conference paper
Theorem Proving in Higher Order Logics (TPHOLs 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2758))

Included in the following conference series:

Abstract

Subroutines are a major complication for Java bytecode verification: they are difficult to fit into the data flow analysis that the Java Virtual Machine (JVM) specification suggests. We examine the problems that occur with subroutines and give an overview of the most prominent solutions in the literature. Using the theorem prover Isabelle/HOL, we have extended our substantial formalization of the JVM and the bytecode verifier with its proof of correctness by the most general solution for bytecode subroutines.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Barthe, G., Dufay, G., Jakubiec, L., de Sousa, S.M., Serpette, B.: A formal correspondence between offensive and defensive JavaCard virtual machines. In: Cortesi, A. (ed.) VMCAI 2002. LNCS, vol. 2294, p. 32. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  2. Basin, D., Friedrich, S., Gawkowski, M.: Verified bytecode model checkers. In: Carreño, V.A., Muñoz, C.A., Tahar, S. (eds.) TPHOLs 2002. LNCS, vol. 2410, pp. 47–66. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. Berghofer, S., Nipkow, T.: Executing higher order logic. In: Callaghan, P., Luo, Z., McKinna, J., Pollack, R. (eds.) TYPES 2000. LNCS, vol. 2277, pp. 24–40. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Coglio, A.: Simple verification technique for complex Java bytecode subroutines. In: Proc. 4th ECOOP Workshop on Formal Techniques for Java-like Programs (2002)

    Google Scholar 

  5. Freund, S.N.: Type Systems for Object-Oriented Intermediate Languages. PhD thesis, Stanford University (2000)

    Google Scholar 

  6. Isabelle home page (2002), http://isabelle.in.tum.de/

  7. Klein, G.: Verified Java Bytecode Verification. PhD thesis, Institut für Informatik, Technische Universität München (2003)

    Google Scholar 

  8. Klein, G., Nipkow, T.: Verified lightweight bytecode verification. Concurrency and Computation: Practice and Experience 13(13), 1133–1151 (2001); Invited contribution to special issue on Formal Techniques for Java

    Article  MATH  Google Scholar 

  9. Klein, G., Nipkow, T.: Verified bytecode verifiers. Theoretical Computer Science 298(3), 583–626 (2002)

    Article  MathSciNet  Google Scholar 

  10. Leroy, X.: Java bytecode verification: an overview. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol. 2102, pp. 265–285. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  11. Leroy, X.: Java bytecode verification: algorithms and formalizations. J. Automated Reasoning (2004) (to appear)

    Google Scholar 

  12. Lindholm, T., Yellin, F.: The Java Virtual Machine Specification. Addison-Wesley, Reading (1996)

    Google Scholar 

  13. Nipkow, T.: Verified bytecode verifiers. In: Honsell, F., Miculan, M. (eds.) FOSSACS 2001. LNCS, vol. 2030, pp. 347–363. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  14. Nipkow, T., Paulson, L.C., Wenzel, M.: Isabelle/HOL. LNCS, vol. 2283. Springer, Heidelberg (2002)

    Book  MATH  Google Scholar 

  15. Posegga, J., Vogt, H.: Java bytecode verification using model checking. In: OOPSLA 1998 Workshop Formal Underpinnings of Java (1998)

    Google Scholar 

  16. Rose, E., Rose, K.: Lightweight bytecode verification. In: OOPSLA 1998 Workshop Formal Underpinnings of Java (1998)

    Google Scholar 

  17. Stärk, R., Schmid, J., Börger, E.: Java and the Java Virtual Machine – Definition, Verification, Validation. Springer, Heidelberg (2001)

    MATH  Google Scholar 

  18. Stata, R., Abadi, M.: A type system for Java bytecode subroutines. In: Proc. 25th ACM Symp. Principles of Programming Languages, pp. 149–161. ACM Press, New York (1998)

    Google Scholar 

  19. Wildmoser, M.: Subroutines and Java bytecode verification. Master’s thesis, Technische Universität München (2002)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technische Universität München, München

    Gerwin Klein & Martin Wildmoser

Authors
  1. Gerwin Klein
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Martin Wildmoser
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Information Security Group, Dep. of Computer Science, ETH Zurich, Switzerland

    David Basin

  2. Computer Science Dept., Saarland University, 66123, Saarbrücken, Germany

    Burkhart Wolff

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Klein, G., Wildmoser, M. (2003). Verified Bytecode Subroutines. In: Basin, D., Wolff, B. (eds) Theorem Proving in Higher Order Logics. TPHOLs 2003. Lecture Notes in Computer Science, vol 2758. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10930755_4

Download citation

  • DOI: https://doi.org/10.1007/10930755_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40664-8

  • Online ISBN: 978-3-540-45130-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation