Fourth IEEE International Conference on Software Engineering and Formal Methods (SEFM'06)
DOI: 10.1109/sefm.2006.4
|View full text |Cite
|
Sign up to set email alerts
|

A PVS Based Framework for Validating Compiler Optimizations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
16
0

Publication Types

Select...
3
2
1

Relationship

0
6

Authors

Journals

citations
Cited by 16 publications
(16 citation statements)
references
References 5 publications
0
16
0
Order By: Relevance
“…A distinguishing feature of our proof technique is that we use an abstraction function, α, to enable us to convert between a configuration in the language domain to a corresponding configuration in the typing domain. Using an abstraction function in proving soundness is a technique used frequently in the domain of processor construction, as introduced in [36], or compiler optimization [37,38]. Lemma 1.…”
Section: Type Preservationmentioning
confidence: 99%
“…A distinguishing feature of our proof technique is that we use an abstraction function, α, to enable us to convert between a configuration in the language domain to a corresponding configuration in the typing domain. Using an abstraction function in proving soundness is a technique used frequently in the domain of processor construction, as introduced in [36], or compiler optimization [37,38]. Lemma 1.…”
Section: Type Preservationmentioning
confidence: 99%
“…One direction is the construction of general frameworks for validation (Zuck et al 2001(Zuck et al , 2003Barret et al 2005;Zaks and Pnueli 2008). Another direction is the development of generic validation algorithms that can be applied to production compilers (Rinard and Marinov 1999;Necula 2000;Zuck et al 2001Zuck et al , 2003Barret et al 2005;Rival 2004;Kanade et al 2006). Finally, validation algorithms specialized to particular classes of transformations have also been developed, such as (Huang et al 2006) for register allocation or (Tristan and Leroy 2008) for instruction scheduling.…”
Section: Related Workmentioning
confidence: 99%
“…While unverified validators are already very useful to increase confidence in the compilation process, a formally verified validator provides an attractive alternative to the formal verification of the corresponding compiler pass (Leinenbach et al 2005;Klein and Nipkow 2006;Leroy 2006;Lerner et al 2003;Blech et al 2005). Several validation algorithms or frameworks use model checking or automatic theorem proving to check verification conditions produced by a run of validation (Zuck et al 2001(Zuck et al , 2003Barret et al 2005;Kanade et al 2006), but the verification condition generator itself is, generally, not formally proved correct.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations