Valgrind

Valgrind is an instrumentation framework for building dynamic analysis tools. There are Valgrind tools that can automatically detect many memory management and threading bugs, and profile your programs in detail. You can also use Valgrind to build new tools. The Valgrind distribution currently includes six production-quality tools: a memory error detector, two thread error detectors, a cache and branch-prediction profiler, a call-graph generating cache and branch-prediction profiler, and a heap profiler. It also includes three experimental tools: a heap/stack/global array overrun detector, a second heap profiler that examines how heap blocks are used, and a SimPoint basic block vector generator. It runs on the following platforms: X86/Linux, AMD64/Linux, ARM/Linux, PPC32/Linux, PPC64/Linux, S390X/Linux, ARM/Android (2.3.x), X86/Darwin and AMD64/Darwin (Mac OS X 10.6 and 10.7).


References in zbMATH (referenced in 41 articles )

Showing results 1 to 20 of 41.
Sorted by year (citations)

1 2 3 next

  1. Dowsley, Rafael; Michalas, Antonis; Nagel, Matthias; Paladi, Nicolae: A survey on design and implementation of protected searchable data in the cloud (2017)
  2. Gagie, Travis; Manzini, Giovanni; Sirén, Jouni: Wheeler graphs: a framework for BWT-based data structures (2017)
  3. Thomas Keck: FastBDT: A speed-optimized and cache-friendly implementation of stochastic gradient-boosted decision trees for multivariate classification (2016) arXiv
  4. Wang, Mu; Gebremedhin, Assefaw; Pothen, Alex: Capitalizing on \itlive variables: new algorithms for efficient Hessian computation via automatic differentiation (2016)
  5. Mushtaq, Hamid; Al-Ars, Zaid; Bertels, Koen: Efficent and highly portable deterministic multithreading (DetLock) (2014) ioport
  6. Ribeiro, Pedro; Silva, Fernando: G-Tries: a data structure for storing and finding subgraphs (2014)
  7. Romano, Anthony: Practical floating-point tests with integer code (2014)
  8. Ye, John; Yan, Hui; Hou, Honglun; Chen, Tianzhou: Potential thread-level-parallelism exploration with superblock reordering (2014) ioport
  9. Emeneker, Wesley; Apon, Amy: On modeling contention for shared caches in multi-core processors with techniques from ecology (2013) ioport
  10. Rahimian, Ashkan; Charland, Philippe; Preda, Stere; Debbabi, Mourad: RESource: a framework for online matching of assembly with open source code (2013) ioport
  11. Biggar, Paul; De Vries, Edsko; Gregg, David: A practical solution for achieving language compatibility in scripting language compilers (2012) ioport
  12. Chang, Feng-Cheng; Huang, Hsiang-Cheh: A refactoring method for cache-efficient swarm intelligence algorithms (2012) ioport
  13. Grinberg, Simon; Weiss, Shlomo: Architectural virtualization extensions: a systems perspective (2012) ioport
  14. Kim, Moonzoo; Kim, Yunho; Choi, Yunja: Concolic testing of the multi-sector Read operation for flash storage platform software (2012) ioport
  15. Mühlberg, Jan Tobias; Lüttgen, Gerald: Verifying compiled file system code (2012) ioport
  16. Spacey, Simon A.; Wiesemann, Wolfram; Kuhn, Daniel; Luk, Wayne: Robust software partitioning with multiple instantiation (2012)
  17. Spacey, Simon; Luk, Wayne; Kelly, Paul H. J.; Kuhn, Daniel: Improving communication latency with the write-only architecture (2012) ioport
  18. Zhang, Ruoyu; Huang, Shiqiu; Qi, Zhengwei; Guan, Haibing: Static program analysis assisted dynamic taint tracking for software vulnerability discovery (2012) ioport
  19. Falcone, Yliès; Mounier, Laurent; Fernandez, Jean-Claude; Richier, Jean-Luc: Runtime enforcement monitors: Composition, synthesis, and enforcement abilities (2011)
  20. Chowdhury, Rezaul Alam; Ramachandran, Vijaya: The cache-oblivious Gaussian elimination paradigm: Theoretical framework, parallelization and Experimental evaluation (2010)

1 2 3 next