2003
DOI: 10.1145/966221.966235
|View full text |Cite
|
Sign up to set email alerts
|

Compiler verification

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
28
0
1

Year Published

2006
2006
2020
2020

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 74 publications
(29 citation statements)
references
References 36 publications
0
28
0
1
Order By: Relevance
“…Since then, many other proofs have been conducted, ranging from single-pass compilers for toy languages to sophisticated code optimizations [8]. In the CompCert experiment, we carry this line of work all the way to end-to-end verification of a complete compilation chain from a structured imperative language down to assembly code through 8 intermediate languages.…”
Section: Introductionmentioning
confidence: 99%
“…Since then, many other proofs have been conducted, ranging from single-pass compilers for toy languages to sophisticated code optimizations [8]. In the CompCert experiment, we carry this line of work all the way to end-to-end verification of a complete compilation chain from a structured imperative language down to assembly code through 8 intermediate languages.…”
Section: Introductionmentioning
confidence: 99%
“…Compiler correctness has been studied extensively, see [7]. In [5], a logical relation is defined between a simply-typed functional language with recursion and low-level code of a SECD machine.…”
Section: Comparisons With Other Workmentioning
confidence: 99%
“…The literature on compiler verification spans over four decades but is mostly limited to whole-program compilation; we refer the reader to the bibliography by Dave [17] for compilers for first-order languages, and to Chlipala [18] for compilers for higherorder functional languages. We have already discussed the existing work [10,12] on compositional compiler correctness in §2.…”
Section: Related Workmentioning
confidence: 99%