A computational logic handbook
A computational logic handbook
Journal of Automated Reasoning
Common LISP: the language (2nd ed.)
Common LISP: the language (2nd ed.)
A verified implementation of an applicative language with dynamic storage allocation
A verified implementation of an applicative language with dynamic storage allocation
Automated proofs of object code for a widely used microprocessor
Automated proofs of object code for a widely used microprocessor
Piton: a mechanically verified assembly-level language
Piton: a mechanically verified assembly-level language
An Industrial Strength Theorem Prover for a Logic Based on Common Lisp
IEEE Transactions on Software Engineering
Mechanized formal reasoning about programs and computing machines
Automated reasoning and its applications
Java Virtual Machine Specification
Java Virtual Machine Specification
ACL2 Theorems About Commercial Microprocessors
FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
A verified code generator for a subset of gypsy
A verified code generator for a subset of gypsy
Are Smart Cards the Ideal Domain for Applying Formal Methods?
ZB '00 Proceedings of the First International Conference of B and Z Users on Formal Specification and Development in Z and B
The SSP: an example of high-assurance systems engineering
HASE'04 Proceedings of the Eighth IEEE international conference on High assurance systems engineering
FAST'05 Proceedings of the Third international conference on Formal Aspects in Security and Trust
| Hi-index | 0.00 |
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.