Sciweavers

250 search results - page 12 / 50
» Static Probabilistic Timing Analysis for Multi-path Programs
Sort
View
ICDCIT
2005
Springer
15 years 4 months ago
Analyzing Loop Paths for Execution Time Estimation
Abstract. Statically estimating the worst case execution time of a program is important for real-time embedded software. This is difficult even in the programming language level du...
Abhik Roychoudhury, Tulika Mitra, Hemendra Singh N...
TAP
2007
Springer
113views Hardware» more  TAP 2007»
15 years 4 months ago
Combining Static and Dynamic Reasoning for Bug Detection
Many static and dynamic analyses have been developed to improve program quality. Several of them are well known and widely used in practice. It is not entirely clear, however, how ...
Yannis Smaragdakis, Christoph Csallner
ECRTS
1998
IEEE
15 years 2 months ago
Facilitating worst-case execution times analysis for optimized code
In this paper we present co-transformation, a novel approach to the mapping of execution information from the source code of a program to the object code for the purpose of worst-...
Jakob Engblom, Andreas Ermedahl, Peter Altenbernd
PPOPP
2003
ACM
15 years 3 months ago
Compiler support for speculative multithreading architecture with probabilistic points-to analysis
Speculative multithreading (SpMT) architecture can exploit thread-level parallelism that cannot be identified statically. Speedup can be obtained by speculatively executing threa...
Peng-Sheng Chen, Ming-Yu Hung, Yuan-Shin Hwang, Ro...
ESOP
1990
Springer
15 years 2 months ago
From Interpreting to Compiling Binding Times
The key to realistic self-applicable partial evaluation is to analyze binding times in the source program, i.e., whether the result of partially evaluating a source expression is ...
Charles Consel, Olivier Danvy