A type system for certified binaries

Shao, Z; Saha, B; Trifonov, V; Papaspyrou, N

dc.contributor.author	Shao, Z	en
dc.contributor.author	Saha, B	en
dc.contributor.author	Trifonov, V	en
dc.contributor.author	Papaspyrou, N	en
dc.date.accessioned	2014-03-01T01:17:24Z
dc.date.available	2014-03-01T01:17:24Z
dc.date.issued	2002	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/14513
dc.subject	Automatic Generation	en
dc.subject	Control Flow	en
dc.subject	Satisfiability	en
dc.subject	Type System	en
dc.subject	Intermediate Language	en
dc.title	A type system for certified binaries	en
heal.type	journalArticle	en
heal.identifier.primary	10.1145/503272.503293	en
heal.identifier.secondary	http://dx.doi.org/10.1145/503272.503293	en
heal.publicationDate	2002	en
heal.abstract	A certified binary is a value together with a proof that the value satisfies a given specification. Existing compilers that generate certified code have focused on simple memory and control-flow safety rather than more advanced properties. In this paper, we present a general framework for explicitly representing complex propositions and proofs in typed intermediate and assembly languages. The new framework	en
heal.journalName	Sigplan Notices	en
dc.identifier.doi	10.1145/503272.503293	en