We describe a formalization of an abstract machine very similar to the Java Virtual Machine but far simpler. We develop techniques for specifying the properties of classes and methods for this machine. We develop techniques for mechanically proving theorems about classes and methods. We discuss two such proofs, that of a static method implementing the factorial function and of an instance method that destructively manipulates objects in a way that takes advantage of inheritance. We conclude with a brief discussion of the advantages and disadvantages of this approach. The formalization and proofs are done with the ACL2 theorem proving system.
CITATION STYLE
Moore, J. S. (1999). Proving Theorems About Java-Like Byte Code (pp. 139–162). https://doi.org/10.1007/3-540-48092-7_7
Mendeley helps you to discover research relevant for your work.