Sciweavers

7393 search results - page 1316 / 1479
» Synthesis-for-testability using transformations
Sort
View
EICS
2011
ACM
14 years 6 months ago
Hayaku: designing and optimizing finely tuned and portable interactive graphics with a graphical compiler
Although reactive and graphically rich interfaces are now mainstream, their development is still a notoriously difficult task. This paper presents Hayaku, a toolset that supports...
Benjamin Tissoires, Stéphane Conversy
EUROSYS
2011
ACM
14 years 6 months ago
Symbolic crosschecking of floating-point and SIMD code
We present an effective technique for crosschecking an IEEE 754 floating-point program and its SIMD-vectorized version, implemented in KLEE-FP, an extension to the KLEE symbolic ...
Peter Collingbourne, Cristian Cadar, Paul H. J. Ke...
FGR
2011
IEEE
241views Biometrics» more  FGR 2011»
14 years 6 months ago
Emotion recognition from an ensemble of features
— This work details the authors’ efforts to push the baseline of expression recognition performance on a realistic database. Both subject-dependent and subject-independent emot...
Usman Tariq, Kai-Hsiang Lin, Zhen Li, Xi Zhou, Zha...
PODC
2011
ACM
14 years 6 months ago
The complexity of robust atomic storage
We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means wait-free tolera...
Dan Dobre, Rachid Guerraoui, Matthias Majuntke, Ne...
RTA
2011
Springer
14 years 6 months ago
Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting
In [5, 15] we presented an approach to prove termination of non-recursive Java Bytecode (JBC) programs automatically. Here, JBC programs are first transformed to finite terminat...
Marc Brockschmidt, Carsten Otto, Jürgen Giesl
« Prev « First page 1316 / 1479 Last » Next »