作者
Christopher Colby, Peter Lee, George C Necula, Fred Blau, Mark Plesko, Kenneth Cline
发表日期
2000/5/1
期刊
ACM SIGPLAN Notices
卷号
35
期号
5
页码范围
95-107
出版商
ACM
简介
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.
引用总数
2000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024617233638312118201814145332313111
学术搜索中的文章
C Colby, P Lee, GC Necula, F Blau, M Plesko, K Cline - ACM SIGPLAN Notices, 2000