A Proof-Carrying Code Architecture for Java
In earlier work, Necula and Lee developed proof-carrying code (PCC) [3,5],which is a mechanism for ensuring the safe behavior of programs. In PCC, a program contains both the code and an encoding of an easy-to-check proof. The validity of the proof, which can be automatically determined by a simple proof-checking program, implies that the code, when executed, will behave safely according to a user-supplied formal definition of safe behavior. Later, Necula and Lee demonstrated the concept of a certifying compiler [6,7].Certifying compilers promise to make PCC more practical by compiling high-level source programs into optimized PCC binaries completely automatically, as opposed to depending on semi-automatic theorem-proving techniques. Taken together, PCC and certifying compilers provide a possible solution to the code safety problem, even in applications involving mobile code .
Unable to display preview. Download preview PDF.
- 2.Leroy, X.: The ZINC experiment, an economical implementation of the ML language. Technical Report 117, INRIA (1990)Google Scholar
- 3.Necula, G., Lee, P.: Safe kernel extensions without run-time checking. In: Second Symposium on Operating Systems Design and Implementation, Seattle, October 1996, pp. 229–243 (1996)Google Scholar
- 6.Necula, G.C.: Compiling with Proofs. PhD thesis, Carnegie Mellon University (October 1998); Available as Technical Report CMU-CS-98-154Google Scholar
- 8.Necula, G.C., Rahul, S.P.: Oracle-based checking of untrusted soft-ware. Submitted to Programming Language Design and Implementation. In: PLDI 2000 (November 1999)Google Scholar