Sciweavers

388 search results - page 46 / 78
» Source-level execution time estimation of C programs
Sort
View
ADAEUROPE
2005
Springer
14 years 1 months ago
The ESA Ravenscar Benchmark
This article presents ERB, the ESA Ravenscar Benchmark. ERB aims at providing a synthetic benchmark comparing the efficiency of various Ada Ravenscar implementations and the RTEMS...
Romain Berrendonner, Jérôme Guitton
SNPD
2003
13 years 9 months ago
Semantics of Minimally Synchronous Parallel ML
This paper presents a new functional parallel language: Minimally Synchronous Parallel ML. The execution time can then be estimated and dead-locks and indeterminism are avoided. I...
Myrto Arapinis, Frédéric Loulergue, ...
POPL
2004
ACM
14 years 8 months ago
Global value numbering using random interpretation
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
Sumit Gulwani, George C. Necula
SIGSOFT
2004
ACM
14 years 8 months ago
PSE: explaining program failures via postmortem static analysis
In this paper, we describe PSE (Postmortem Symbolic Evaluation), a static analysis algorithm that can be used by programmers to diagnose software failures. The algorithm requires ...
Roman Manevich, Manu Sridharan, Stephen Adams, Man...
PDP
2010
IEEE
14 years 2 months ago
A Light-weight API for Portable Multicore Programming
—Multicore nodes have become ubiquitous in just a few years. At the same time, writing portable parallel software for multicore nodes is extremely challenging. Widely available p...
Christopher G. Baker, Michael A. Heroux, H. Carter...