This paper presents the initial results of a project to determine if the techniques of proof-carrying code and certifying compilers can be applied to programming languages of realistic size and complexity. The experiment shows that: (1) it is possible to implement a certifying native-code compiler for a large subset of the Java programming language; (2) the compiler is freely able to apply many standard local and global optimizations; and (3) the PCC binaries it produces are of reasonable size and can be rapidly checked for type safety by a small proof-checker. This paper also presents further evidence that PCC provides several advantages for compiler development. In particular, generating proofs of the target code helps to identify compiler bugs, many of which would have been difficult to discover by testing. Copyright 2000 ACM.
CITATION STYLE
Colby, C., Lee, P., Necula, G. C., Blau, F., Plesko, M., & Cline, K. (2000). A certifying compiler for Java. SIGPLAN Notices (ACM Special Interest Group on Programming Languages), 35(5), 95–107. https://doi.org/10.1145/358438.349315
Mendeley helps you to discover research relevant for your work.