94 search results - page 2 / 19 » Detecting loop-carried dependences in programs with dynamic ... |
IEEEPACT
1999
IEEE
13 years 9 months ago
1999
IEEE
Automatic parallelization of general-purpose programs is still not possible in general in the presence of irregular data structures and complex control-flows. One promising strate...
SIGCOMM
2010
ACM
13 years 5 months ago
2010
ACM
Dynamic Datastructure Excavation (DDE) is a new approach to extract datastructures from C binaries without any need for debugging symbols. Unlike most existing tools, DDE uses dyn...
AADEBUG
1997
Springer
13 years 9 months ago
1997
Springer
We introduce an assertion language for run-time checking of linked list data structure shapes. The assertion language is expressive enough to define characteristic predicates for ...
AMR
2006
Springer
13 years 9 months ago
2006
Springer
An original task of structuring and labeling large television streams is tackled in this paper. Emphasis is put on simple and efficient methods to detect precise boundaries of prog...
MICRO
2009
IEEE
14 years 11 hour ago
2009
IEEE
Data structures define how values being computed are stored and accessed within programs. By recognizing what data structures are being used in an application, tools can make app...