Sciweavers

268 search results - page 28 / 54
» Automated Analysis of Data-Dependent Programs with Dynamic M...
Sort
View
ASPLOS
2008
ACM
13 years 9 months ago
Dispersing proprietary applications as benchmarks through code mutation
Industry vendors hesitate to disseminate proprietary applications to academia and third party vendors. By consequence, the benchmarking process is typically driven by standardized...
Luk Van Ertvelde, Lieven Eeckhout
HIPC
2003
Springer
14 years 22 days ago
Thread Migration/Checkpointing for Type-Unsafe C Programs
Thread migration/checkpointing is becoming indispensable for load balancing and fault tolerance in high performance computing applications, and its success depends on the migration...
Hai Jiang, Vipin Chaudhary
OOPSLA
2004
Springer
14 years 27 days ago
The garbage collection advantage: improving program locality
As improvements in processor speed continue to outpace improvements in cache and memory speed, poor locality increasingly degrades performance. Because copying garbage collectors ...
Xianglong Huang, Stephen M. Blackburn, Kathryn S. ...
ICSE
2008
IEEE-ACM
14 years 8 months ago
Dynamic detection of atomic-set-serializability violations
Previously we presented atomic sets, memory locations that share some consistency property, and units of work, code fragments that preserve consistency of atomic sets on which the...
Christian Hammer, Julian Dolby, Mandana Vaziri, Fr...
POPL
2003
ACM
14 years 7 months ago
New results on the computability and complexity of points - to analysis
Given a program and two variables p and q, the goal of points-to analysis is to check if p can point to q in some execution of the program. This well-studied problem plays a cruci...
Venkatesan T. Chakaravarthy