Sciweavers

1145 search results - page 21 / 229
» The Correctness of an Optimized Code Generation
Sort
View
ADAEUROPE
2007
Springer
13 years 9 months ago
Automatic Ada Code Generation Using a Model-Driven Engineering Approach
Currently, Model-Driven Engineering (MDE) is considered one of the most promising approaches for software development. In this paper, a simple but complete example based on state-m...
Diego Alonso, Cristina Vicente-Chicote, Pedro S&aa...
SAC
2006
ACM
13 years 7 months ago
Assisted verification of elementary functions using Gappa
The implementation of a correctly rounded or interval elementary function needs to be proven carefully in the very last details. The proof requires a tight bound on the overall er...
Florent de Dinechin, Christoph Quirin Lauter, Guil...
ENTCS
2008
139views more  ENTCS 2008»
13 years 7 months ago
Pervasive Compiler Verification - From Verified Programs to Verified Systems
We report in this paper on the formal verification of a simple compiler for the C-like programming language C0. The compiler correctness proof meets the special requirements of pe...
Dirk Leinenbach, Elena Petrova
ADAEUROPE
2007
Springer
14 years 1 months ago
Correctness by Construction for High-Integrity Real-Time Systems: A Metamodel-Driven Approach
Current trends in software engineering promote the contention that the use of model-driven approaches should prove as beneficial to high-integrity systems as they have to business ...
Matteo Bordin, Tullio Vardanega
NIPS
2003
13 years 9 months ago
When Does Non-Negative Matrix Factorization Give a Correct Decomposition into Parts?
We interpret non-negative matrix factorization geometrically, as the problem of finding a simplicial cone which contains a cloud of data points and which is contained in the posi...
David L. Donoho, Victoria Stodden