mlsanityData to 7 Oct 2026

An Empirical Study of Static Analysis Tools for Secure Code Review

arXiv 2407.12241 ↗First posted 17 Jul 2024cs.SEcited by 17

Not on the map. Why?

Abstract (arXiv)

Early identification of security issues in software development is vital to minimize their unanticipated impacts. Code review is a widely used manual analysis method that aims to uncover security issues along with other coding issues in software projects. While some studies suggest that automated static application security testing tools (SASTs) could enhance security issue identification, there is limited understanding of SAST's practical effectiveness in supporting secure code review. Moreover, most SAST studies rely on synthetic or fully vulnerable versions of the subject program, which may not accurately represent real-world code changes in the code review process. To address this gap, we study C/C++ SASTs using a dataset of actual code changes that contributed to exploitable vulnerabilities. Beyond SAST's effectiveness, we quantify potential benefits when changed functions are prioritized by SAST warnings. Our dataset comprises 319 real-world vulnerabilities from 815 vulnerability-contributing commits (VCCs) in 92 C and C++ projects. The result reveals that a single SAST can produce warnings in vulnerable functions of 52% of VCCs. Prioritizing changed functions with SAST warnings can improve accuracy (i.e., 12% of precision and 5.6% of recall) and reduce Initial False Alarm (lines of code in non-vulnerable functions inspected until the first vulnerable function) by 13%. Nevertheless, at least 76% of the warnings in vulnerable functions are irrelevant to the VCCs, and 22% of VCCs remain undetected due to limitations of SAST rules. Our findings highlight the benefits and the remaining gaps of SAST-supported secure code reviews and challenges that should be addressed in future work.

Key facts. Cited by 17 papers in the map (data through 7 Oct 2026). First posted on arXiv 17 Jul 2024.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 3; 2025: 7; 2026: 7.

17 papers.

Sort:

By area:

  1. 2024Black-Box Adversarial Attacks on LLM-Based Code Completioncited by 13
  2. 2025Exploring the Security Threats of Knowledge Base Poisoning in Retrieval-Augmented Code Generationcited by 9
  3. 2025How Safe Are AI-Generated Patches? A Large-scale Study on Security Risks in LLM and Agentic Automated Program Repair on SWE-benchcited by 5
  4. 2025SecureReviewer: Enhancing Large Language Models for Secure Code Review through Secure-aware Fine-tuningcited by 5
  5. 2026HalluJudge: A Reference-Free Hallucination Detection for Context Misalignment in Code Review Automationcited by 5
  6. 2024SeCodePLT: A Unified Platform for Evaluating the Security of Code GenAIcited by 4
  7. 2025Benchmarking Correctness and Security in Multi-Turn Code Generationcited by 4
  8. 2024REDO: Execution-Free Runtime Error Detection for COding Agentscited by 2
  9. 2026AgenticSCR: An Autonomous Agentic Secure Code Review for Immature Vulnerabilities Detectioncited by 2
  10. 2025Bridging Semantics & Structure for Software Vulnerability Detection using Hybrid Network Modelscited by 1
  11. 2026Multi-task LLMs for Bug Classification: Efficient Inference with Auxiliary Decoding Headscited by 1
  12. 2026Revelio: Cost-Efficient Agentic Memory Safety Vulnerability Detection For Repository-Scale Codebasescited by 1
5 more
  1. 2025Fine-Tuning Multilingual Language Models for Code Review: An Empirical Study on Industrial C# Projectscited by 0
  2. 2025LLaVul: A Multimodal LLM for Interpretable Vulnerability Reasoning about Source Codecited by 0
  3. 2026IntelliSA: An Intelligent Static Analyzer for IaC Security Smell Detection Using Symbolic Rules and Neural Inferencecited by 0
  4. 2026Benchmarked Yet Not Measured -- Generative AI Should be Evaluated Against Real-World Utilitycited by 0
  5. 2026OpenAnt: LLM-Powered Vulnerability Discovery Through Code Decomposition, Adversarial Verification, and Dynamic Testingcited by 0