Sciweavers

400 search results - page 58 / 80
» Reasoning About Hidden Mechanisms
Sort
View
POPL
2006
ACM
15 years 10 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
153
Voted
POPL
2005
ACM
15 years 10 months ago
Automated soundness proofs for dataflow analyses and transformations via local rules
We present Rhodium, a new language for writing compiler optimizations that can be automatically proved sound. Unlike our previous work on Cobalt, Rhodium expresses optimizations u...
Sorin Lerner, Todd D. Millstein, Erika Rice, Craig...
ICSE
2003
IEEE-ACM
15 years 9 months ago
Cadena: An Integrated Development, Analysis, and Verification Environment for Component-based Systems
The use of component models such as Enterprise Java Beans and the CORBA Component Model (CCM) in application development is expanding rapidly. Even in real-time safety/mission-cri...
John Hatcliff, Xianghua Deng, Matthew B. Dwyer, Ge...
TLDI
2009
ACM
111views Formal Methods» more  TLDI 2009»
15 years 6 months ago
A generic type-and-effect system
Type-and-effect systems are a natural approach for statically reasoning about a program’s execution. They have been used to track a variety of computational effects, for example...
Daniel Marino, Todd D. Millstein
LATA
2009
Springer
15 years 4 months ago
Termination of Priority Rewriting
Introducing priorities on rules in rewriting increases their expressive power and helps to limit computations. Priority rewriting is used in rule-based programming as well as in f...
Isabelle Gnaedig