Sciweavers

859 search results - page 124 / 172
» Explaining Synthesized Software
Sort
View
SEFM
2007
IEEE
14 years 3 months ago
Automatically Proving Concurrent Programs Correct
of abstract interpretations in formal methods It is always very satisfying to hear about a theory, in the case at hand it is the theory of abstract interpretations, that explains i...
Byron Cook
AAECC
2007
Springer
109views Algorithms» more  AAECC 2007»
14 years 2 months ago
The Tangent FFT
The split-radix FFT computes a size-n complex DFT, when n is a large power of 2, using just 4n lg n−6n+8 arithmetic operations on real numbers. This operation count was first an...
Daniel J. Bernstein
CODES
2006
IEEE
14 years 2 months ago
A formal approach to robustness maximization of complex heterogeneous embedded systems
Embedded system optimization typically considers objectives such as cost, timing, buffer sizes and power consumption. Robustness criteria, i.e. sensitivity of the system to variat...
Arne Hamann, Razvan Racu, Rolf Ernst
IUI
2006
ACM
14 years 2 months ago
Automatic construction of personalized customer interfaces
Interface personalization can improve a user’s performance and subjective impression of interface quality and responsiveness. Personalization is difficult to implement as it req...
Robert Price, Russell Greiner, Gerald Häubl, ...
ECRTS
2005
IEEE
14 years 2 months ago
Non-blocking Deterministic Replacement of Functionality, Timing, and Data-Flow for Hard Real-Time Systems at Runtime
Embedded systems are usually an integral component of a larger system and are used to control and/or directly monitor this system by using special hardware devices. The complexity...
Sebastian Fischmeister, Klemens Winkler