Verified Peephole Optimizations for CompCert Eric Mullen Daryl Zuniga University of Washington, USA

First Page		Document Content
Date: 2016-08-08 16:17:02 Computing Software engineering Software Compiler optimizations Programming language implementation Compiler construction Formal methods Logic in computer science CompCert Low-level programming language Peephole optimization Formal verification		Verified Peephole Optimizations for CompCert Eric Mullen Daryl Zuniga University of Washington, USA Add to Reading List Source URL: peek.uwplse.org Download Document from Source Website File Size: 381,17 KB Share Document on Facebook

	A Concrete Memory Model for CompCert∗ Fr´ed´eric Besson1 , Sandrine Blazy2 , and Pierre Wilke2 1 2 DocID: 1uct5 - View Document
	Mechanized semantics for compiler verification or: CompCert’s tortuous path through semantics land Xavier Leroy INRIA Paris-Rocquencourt DocID: 1rXSq - View Document
	Verified Peephole Optimizations for CompCert Eric Mullen Daryl Zuniga University of Washington, USA DocID: 1rsFQ - View Document
	A formally verified compiler for critical embedded software Xavier Leroy INRIA Paris-Rocquencourt LCTES, DocID: 1ro7T - View Document
	Introduction CompCert Flocq CompCert+Flocq Conclusion A Formally-Verified C Compiler Supporting Floating-Point Arithmetic Sylvie Boldo Jacques-Henri Jourdan Xavier Leroy Guillaume Melquiond DocID: 1myBZ - View Document