Sciweavers

53 search results - page 5 / 11
» Engineering a Sound Assertion Semantics for the Verifying Co...
Sort
View
150
Voted
POPL
2011
ACM
14 years 6 months ago
The essence of compiling with traces
The technique of trace-based just-in-time compilation was introduced by Bala et al. and was further developed by Gal et al. It currently enjoys success in Mozilla Firefox’s Java...
Shu-yu Guo, Jens Palsberg
POPL
2006
ACM
16 years 4 months ago
Formal certification of a compiler back-end or: programming a compiler with a proof assistant
This paper reports on the development and formal certification (proof of semantic preservation) of a compiler from Cminor (a Clike imperative language) to PowerPC assembly code, u...
Xavier Leroy
142
Voted
PLDI
2003
ACM
15 years 9 months ago
A provably sound TAL for back-end optimization
Typed assembly languages provide a way to generate machinecheckable safety proofs for machine-language programs. But the soundness proofs of most existing typed assembly languages...
Juan Chen, Dinghao Wu, Andrew W. Appel, Hai Fang
TASE
2008
IEEE
15 years 10 months ago
Verifying BPEL-Like Programs with Hoare Logic
The WS-BPEL language has recently become a de facto standard for modeling Web-based business processes. One of its essential features is the fully programmable compensation mechan...
Chenguang Luo, Shengchao Qin, Zongyan Qiu
FSEN
2009
Springer
15 years 10 months ago
Program Logics for Sequential Higher-Order Control
We introduce a Hoare logic for higher-order functional languages with control operators such as callcc. The key idea is to build the assertion language and proof rules around an e...
Martin Berger