Sciweavers

1291 search results - page 182 / 259
» Arithmetic program paths
Sort
View
CGO
2007
IEEE
15 years 11 months ago
Rapidly Selecting Good Compiler Optimizations using Performance Counters
Applying the right compiler optimizations to a particular program can have a significant impact on program performance. Due to the non-linear interaction of compiler optimization...
John Cavazos, Grigori Fursin, Felix V. Agakov, Edw...
FCCM
2007
IEEE
108views VLSI» more  FCCM 2007»
15 years 11 months ago
Configurable Transactional Memory
Programming efficiency of heterogeneous concurrent systems is limited by the use of lock-based synchronization mechanisms. Transactional memories can greatly improve the programmi...
Christoforos Kachris, Chidamber Kulkarni
SP
2007
IEEE
15 years 11 months ago
Using Rescue Points to Navigate Software Recovery
We present a new technique that enables software recovery in legacy applications by retrofitting exception-handling capabilities, error virtualization using rescue points. We int...
Stelios Sidiroglou, Oren Laadan, Angelos D. Keromy...
CC
2005
Springer
323views System Software» more  CC 2005»
15 years 10 months ago
CodeSurfer/x86-A Platform for Analyzing x86 Executables
CodeSurfer/x86 is a prototype system for analyzing x86 executables. It uses a static-analysis algorithm called value-set analysis (VSA) to recover intermediate representations that...
Gogul Balakrishnan, Radu Gruian, Thomas W. Reps, T...
ICSE
2010
IEEE-ACM
15 years 9 months ago
Developers ask reachability questions
A reachability question is a search across feasible paths through a program for target statements matching search criteria. In three separate studies, we found that reachability q...
Thomas D. LaToza, Brad A. Myers