Sciweavers

945 search results - page 117 / 189
» Incremental Branching Programs
Sort
View
HPCA
2001
IEEE
14 years 8 months ago
Speculative Data-Driven Multithreading
Mispredicted branches and loads that miss in the cache cause the majority of retirement stalls experienced by sequential processors; we call these critical instructions. Despite t...
Amir Roth, Gurindar S. Sohi
SIGSOFT
2003
ACM
14 years 8 months ago
A strategy for efficiently verifying requirements
This paper describes a compositional proof strategy for verifying properties of requirements specifications. The proof strategy, which may be applied using either a model checker ...
Ralph D. Jeffords, Constance L. Heitmeyer
PLDI
2005
ACM
14 years 1 months ago
Pin: building customized program analysis tools with dynamic instrumentation
Robust and powerful software instrumentation tools are essential for program analysis tasks such as profiling, performance evaluation, and bug detection. To meet this need, we ha...
Chi-Keung Luk, Robert S. Cohn, Robert Muth, Harish...
PLDI
2010
ACM
14 years 26 days ago
Smooth interpretation
We present smooth interpretation, a method to systematically approximate numerical imperative programs by smooth mathematical functions. This approximation facilitates the use of ...
Swarat Chaudhuri, Armando Solar-Lezama
ICSE
2009
IEEE-ACM
14 years 8 months ago
The road not taken: Estimating path execution frequency statically
A variety of compilers, static analyses, and testing frameworks rely heavily on path frequency information. Uses for such information range from optimizing transformations to bug ...
Raymond P. L. Buse, Westley Weimer