Sciweavers

548 search results - page 2 / 110
» Parallel Relative Debugging with Dynamic Data Structures
Sort
View
IPPS
1998
IEEE
14 years 23 days ago
DEEP: A Development Environment for Parallel Programs
The use of the DEEP development environment to analyze parallel program performance is described. The full integrated environment contains tools for the creation, analysis and deb...
Brian Q. Brode, Chris R. Warber
POPL
2007
ACM
14 years 8 months ago
Dynamic heap type inference for program understanding and debugging
C programs can be difficult to debug due to lax type enforcement and low-level access to memory. We present a dynamic analysis for C that checks heap snapshots for consistency wit...
Ben Liblit, Chloë W. Schulze, Marina Polishch...
IPPS
2009
IEEE
14 years 3 months ago
Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
Kamesh Madduri, David A. Bader
SIGCOMM
2010
ACM
13 years 8 months ago
DDE: dynamic data structure excavation
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...
Asia Slowinska, Traian Stancescu, Herbert Bos
GECCO
2008
Springer
112views Optimization» more  GECCO 2008»
13 years 9 months ago
Handling dynamic data structures in search based testing
There has been little attention to search based test data generation in the presence of pointer inputs and dynamic data structures, an area in which recent concolic methods have e...
Kiran Lakhotia, Mark Harman, Phil McMinn