• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations

DMCA

A machine-checked model for a Java-like language, virtual machine and compiler (2004)

Cached

  • Download as a PDF

Download Links

  • [www.cse.unsw.edu.au]
  • [doclsf.de]
  • [isabelle.in.tum.de]
  • [www.cse.unsw.edu.au]
  • [www4.informatik.tu-muenchen.de]
  • [www4.in.tum.de]
  • [ssrg.nicta.com.au]
  • [www.ssrg.nicta.com.au]
  • [www.ssrg.nicta.com.au]
  • [isabelle.in.tum.de]
  • [isabelle.in.tum.de]
  • [afp.sourceforge.net]
  • [afp.sourceforge.net]
  • [afp.sf.net]
  • [afp.sf.net]
  • [users.cecs.anu.edu.au]

  • Save to List
  • Add to Collection
  • Correct Errors
  • Monitor Changes
by Gerwin Klein , Tobias Nipkow
Venue:ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS
Citations:126 - 9 self
  • Summary
  • Citations
  • Active Bibliography
  • Co-citation
  • Clustered Documents
  • Version History

BibTeX

@ARTICLE{Klein04amachine-checked,
    author = {Gerwin Klein and Tobias Nipkow},
    title = {A machine-checked model for a Java-like language, virtual machine and compiler},
    journal = {ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS},
    year = {2004},
    volume = {28},
    pages = {2006}
}

Share

Facebook Twitter Reddit Bibsonomy

OpenURL

 

Abstract

We introduce Jinja, a Java-like programming language with a formal semantics designed to exhibit core features of the Java language architecture. Jinja is a compromise between realism of the language and tractability and clarity of the formal semantics. The following aspects are formalised: a big and a small step operational semantics for Jinja and a proof of their equivalence; a type system and a definite initialisation analysis; a type safety proof of the small step semantics; a virtual machine (JVM), its operational semantics and its type system; a type safety proof for the JVM; a bytecode verifier, i.e. data flow analyser for the JVM; a correctness proof of the bytecode verifier w.r.t. the type system; a compiler and a proof that it preserves semantics and well-typedness. The emphasis of this work is not on particular language features but on providing a unified model of the source language, the virtual machine and the compiler. The whole development has been carried out in the theorem prover Isabelle/HOL.

Keyphrases

virtual machine    machine-checked model    type system    java-like language    bytecode verifier    type safety proof    formal semantics    definite initialisation analysis    small step operational semantics    java-like programming language    core feature    theorem prover isabelle hol    operational semantics    java language architecture    whole development    source language    small step semantics    following aspect    particular language feature    correctness proof    unified model   

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University