• Published 1999

Credible Compilation

@inproceedings{Rinard1999CredibleC,
  title={Credible Compilation},
  author={Martin C. Rinard},
  year={1999}
}
This paper presents an approach to compiler correctness in which the compiler generates a proof that the transformed program correctly implements the input program. A simple proof checker can then verify that the program was compiled correctly. We call a compiler that produces such proofs a credible compiler, because it produces verifiable evidence that it is operating correctly. 

Citations

Publications citing this paper.
SHOWING 1-10 OF 40 CITATIONS

Optimisation Validation

VIEW 5 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Partial Translation Verification for Untrusted Code-Generators

VIEW 3 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Overcoming the challenges to feedback-directed optimization (Keynote Talk)

VIEW 3 EXCERPTS
CITES BACKGROUND
HIGHLY INFLUENCED

Witnessing Secure Compilation

VIEW 3 EXCERPTS
CITES BACKGROUND & METHODS

Deriving Bisimulation Relations from Path Extension Based Equivalence Checkers

VIEW 1 EXCERPT
CITES METHODS

References

Publications referenced by this paper.
SHOWING 1-10 OF 11 REFERENCES

Credible compilation

  • Martin Rinard
  • Technical Report MIT-LCS-TR-776,
  • 1999
VIEW 2 EXCERPTS

Translation validation

  • A. Pnueli, M. Siegal, E. Singerman
  • Proceedings of the 4th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Lisbon, Portugal, March
  • 1998
VIEW 1 EXCERPT

VLISP: A verified implementation of Scheme

VIEW 1 EXCERPT

Assigning Meanings to Programs

VIEW 1 EXCERPT