Neutaint: Efficient Dynamic Taint Analysis with Neural Networks
Not on the map. Why?
Abstract (arXiv)
Dynamic taint analysis (DTA) is widely used by various applications to track information flow during runtime execution. Existing DTA techniques use rule-based taint-propagation, which is neither accurate (i.e., high false positive) nor efficient (i.e., large runtime overhead). It is hard to specify taint rules for each operation while covering all corner cases correctly. Moreover, the overtaint and undertaint errors can accumulate during the propagation of taint information across multiple operations. Finally, rule-based propagation requires each operation to be inspected before applying the appropriate rules resulting in prohibitive performance overhead on large real-world applications. In this work, we propose NEUTAINT, a novel end-to-end approach to track information flow using neural program embeddings. The neural program embeddings model the target's programs computations taking place between taint sources and sinks, which automatically learns the information flow by observing a diverse set of execution traces. To perform lightweight and precise information flow analysis, we utilize saliency maps to reason about most influential sources for different sinks. NEUTAINT constructs two saliency maps, a popular machine learning approach to influence analysis, to summarize both coarse-grained and fine-grained information flow in the neural program embeddings. We compare NEUTAINT with 3 state-of-the-art dynamic taint analysis tools. The evaluation results show that NEUTAINT can achieve 68% accuracy, on average, which is 10% improvement while reducing 40 times runtime overhead over the second-best taint tool Libdft on 6 real world programs. NEUTAINT also achieves 61% more edge coverage when used for taint-guided fuzzing indicating the effectiveness of the identified influential bytes.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 8 Jul 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 0; 2023: 0; 2024: 0; 2025: 2; 2026: 3.
7 papers.
- 2021Unsolved Problems in ML Safetycited by 291
- 2026Ghost in the Agent: Redefining Information Flow Tracking for LLM Agentscited by 14
- 2026MemLineage: Lineage-Guided Enforcement for LLM Agent Memorycited by 14
- 2021Automated Side Channel Analysis of Media Software with Manifold Learningcited by 1
- 2025Taming Data Challenges in ML-based Security Tasks Using Generative AIcited by 0
- 2025Learning to Triage Vulnerability Reports from Program Analysis: An Empirical Study in Node.jscited by 0
- 2026SoK: AI-Augmented Binary Reversingcited by 0
- 2026SoK: AI-Augmented Binary Reversing16 Jun 2026
- 2026MemLineage: Lineage-Guided Enforcement for LLM Agent Memory14 May 2026
- 2026Ghost in the Agent: Redefining Information Flow Tracking for LLM Agents25 Apr 2026
- 2025Learning to Triage Vulnerability Reports from Program Analysis: An Empirical Study in Node.js23 Oct 2025
- 2025Taming Data Challenges in ML-based Security Tasks Using Generative AI8 Jul 2025
- 2021Automated Side Channel Analysis of Media Software with Manifold Learning9 Dec 2021
- 2021Unsolved Problems in ML Safety28 Sep 2021