Back to Rankings

Guiding Symbolic Execution with Static Analysis and LLMs for Vulnerability Discovery

Md Shafiuzzaman, Achintya Desai, Wenbo Guo, Tevfik Bultan

Apr 7, 2026arXiv:2604.06506v1
cs.CRcs.SE
Share
Scorecard· 5/16
8.0/10 impact

Abstract

Symbolic execution detects vulnerabilities with precision, but applying it to large codebases requires harnesses that set up symbolic state, model dependencies, and specify assertions. Writing these harnesses has traditionally been a manual process requiring expert knowledge, which significantly limits the scalability of the technique. We present Static Analysis Informed and LLM-Orchestrated Symbolic Execution (SAILOR), which automates symbolic execution harness construction by combining static analysis with LLM-based synthesis. SAILOR operates in three phases: (1) static analysis identifies candidate vulnerable locations and generates vulnerability specifications; (2) an LLM uses vulnerability specifications and orchestrates harness synthesis by iteratively refining drivers, stubs, and assertions against compiler and symbolic execution feedback; symbolic execution then detects vulnerabilities using the generated harness, and (3) concrete replay validates the symbolic execution results against the unmodified project source. This design combines the scalability of static analysis, the code reasoning of LLMs, the path precision of symbolic execution, and the ground truth produced by concrete execution. We evaluate SAILOR on 10 open-source C/C++ projects totaling 6.8 M lines of code. SAILOR discovers 379 distinct, previously unknown memory-safety vulnerabilities (421 confirmed crashes). The strongest of five baselines we compare SAILOR to (agentic vulnerability detection using Claude Code with full codebase access and unlimited interaction), finds only 12 vulnerabilities. Each phase of SAILOR is critical: Without static analysis targeting confirmed vulnerabilities drop 12.2X; without iterative LLM synthesis zero vulnerabilities are confirmed; and without symbolic execution no approach can detect more than 12 vulnerabilities.

AI Impact Assessments

(3 models)

Scientific Impact Assessment: SAILOR

1. Core Contribution

SAILOR addresses a fundamental and long-standing bottleneck in symbolic execution: the manual construction of harnesses (drivers, stubs, and assertions) required to apply SE to large codebases. The paper's key insight is that three techniques—static analysis, LLMs, and symbolic execution—are individually insufficient but compositionally powerful. Static analysis answers *where* vulnerabilities may reside, the LLM answers *how* to construct a harness reaching that location, and SE answers *whether* the vulnerability is feasible via constraint solving. The concrete validation phase (ASan replay against unmodified binaries) provides a ground truth that is independent of both the LLM and the harness, addressing the trustworthiness problem inherent in LLM-generated artifacts.

The three-phase architecture is well-motivated: Phase 1 transforms a massive codebase into independent, self-contained vulnerability specifications; Phase 2 uses an LLM-orchestrated iterative loop to synthesize and refine harnesses against compiler/KLEE feedback; Phase 3 filters false positives via concrete execution. The design that each specification is processed independently enables embarrassing parallelism, which is critical for scalability.

2. Methodological Rigor

Strengths in experimental design:

  • The evaluation spans 10 diverse open-source projects (6.8M LOC), covering different domains and sizes (63K to 1.84M LOC).
  • Five baselines are carefully designed to isolate the contribution of each component: human-written SE harnesses (B1), one-shot LLM harnesses (B2), LLM-only detection (B3), SA-guided LLM detection (B4), and agentic LLM with unlimited turns (B5).
  • The ablation (A1: SAILOR without SA) directly quantifies the 12.2× contribution of static analysis targeting.
  • Concrete validation against unmodified project binaries with ASan is a strong methodological choice that eliminates false positives from unrealistic harness setups.
  • The paper honestly reports failures: curl (0 bugs, complex session setup), OpenSSL (0 bugs, compilation failures), SQLite (0 confirmed, KLEE values can't reconstruct database state).
  • Potential concerns:

  • The deduplication strategy (file, function, line) may either over-count (multiple reports for the same root cause) or under-count. The paper acknowledges this but doesn't investigate further.
  • The 60% fuzz-reproduction rate (251/421) raises questions about the remaining 170 crashes—while the paper explains they require precise multi-field initialization, more analysis of whether these represent realistic attack scenarios would strengthen the claims.
  • Token costs are reported (2.29B tokens total) but dollar costs are not, making practical cost assessment difficult. The 37% token waste on projects yielding zero bugs is notable.
  • Using GPT-5 (a very recent, powerful model) may limit near-term reproducibility, though the DeepSeek-V3.2 experiment (12 vs 14 bugs on libtiff) provides some evidence of model robustness.
  • 3. Potential Impact

    Immediate impact: SAILOR could transform how symbolic execution is applied in practice. The primary barrier to SE adoption has always been harness construction; automating this opens SE to codebases that were previously inaccessible. Finding 379 previously unknown vulnerabilities in widely-used projects (binutils, FFmpeg, mupdf, SELinux) is a compelling demonstration.

    Broader implications:

  • The pipeline architecture (SA → LLM orchestration → formal method → concrete validation) is a design pattern applicable beyond vulnerability detection—to verification, test generation, and program analysis more broadly.
  • The iterative LLM refinement loop against tool feedback is a generalizable technique for LLM-assisted program synthesis.
  • The concrete validation phase addresses a critical trust problem: LLM outputs cannot be trusted without independent verification, and this paper provides a systematic approach.
  • Practical adoption barriers: The pipeline requires CodeQL database construction, KLEE integration, and significant compute resources (128 parallel workers). The 2.29B token consumption across 10 projects represents substantial cost.

    4. Timeliness & Relevance

    This paper sits at the intersection of two hot trends: LLM-assisted software engineering and automated vulnerability detection. The timing is excellent—LLMs have reached the capability level where they can reason about code structure and generate compilable harnesses, but they cannot independently verify their outputs. SAILOR fills this gap by using LLMs for what they're good at (code understanding, synthesis) while relying on formal methods for what they're good at (precision, verification).

    The paper addresses a genuine current need: despite decades of research on symbolic execution, its adoption remains limited precisely because of the harness problem. Fuzzing has won the practical adoption battle largely because it requires simpler setup; SAILOR could shift this balance.

    5. Strengths & Limitations

    Key strengths:

  • Massive quantitative gap over baselines: 379 vs. 12 (best baseline) is a 31× improvement that is hard to dismiss.
  • No manual intervention: Unlike STASE and Sys, SAILOR requires no manual harness writing or project-specific configuration beyond a build script.
  • Principled compositionality: Each component is necessary (demonstrated by ablation), and none alone is sufficient.
  • Reproducibility commitment: Zenodo artifact with implementation and baselines.
  • Honest failure analysis: Clear explanation of why 3 projects yielded 0 bugs, and analysis of 15 missed vulnerabilities.
  • Notable limitations:

  • C/C++ memory safety only: The approach is specialized to memory-safety CWEs in C/C++. Extension to other vulnerability classes or languages is claimed to be possible but not demonstrated.
  • KLEE dependency: KLEE's limitations (path explosion, environment modeling) are inherited. 73% of missed bugs are attributed to KLEE limitations.
  • LLM cost: 2.29B tokens with GPT-5 is expensive; cost-effectiveness analysis is absent.
  • Vulnerability severity: The paper reports CWE categories and crash types but does not assess exploitability or severity (e.g., CVSS scores). Not all memory safety bugs are equally impactful.
  • Responsible disclosure timing: Crash reproducers are withheld pending disclosure—reviewers cannot independently verify the 379 claims until disclosure completes.
  • 6. Additional Observations

    The paper's running example (binutils CWE-122) is exceptionally well-chosen and traced through all three phases, making the approach concrete and understandable. The 34-query CodeQL suite (13 standard + 21 custom) represents a non-trivial engineering contribution. The finding that B5 (agentic Claude Code with unlimited turns) finds only 12 bugs is a striking result that highlights the fundamental limitation of LLM-only approaches for deep vulnerability detection.

    Rating:8.2/ 10
    Significance 8.5Rigor 7.8Novelty 8Clarity 8.5

    Generated Apr 9, 2026

    Comparison History (175)

    Wonvs. Which Model Is Actually Serving You? IRIS: Budgeted Black-Box Auditing of Model Substitution and Routing Dilution in LLM Gateways

    Paper 2 addresses a fundamental scalability bottleneck in vulnerability discovery and demonstrates striking real-world results: 379 previously unknown memory-safety vulnerabilities across 6.8M LOC, vastly outperforming baselines (12 vulnerabilities). Its combination of static analysis, LLMs, symbolic execution, and concrete validation is methodologically rigorous with clear ablations proving each component's necessity. The security impact is broad and immediately actionable. Paper 1 tackles an important but narrower niche (LLM gateway auditing) with elegant methodology, but its impact is more specialized and its findings less transformative for broad scientific or engineering communities.

    claude-opus-4-8·Jul 24, 2026
    Wonvs. CryptanalysisBench: Can LLMs do Cryptanalysis?

    Paper 2 presents a highly rigorous neuro-symbolic approach that solves a long-standing scalability bottleneck in symbolic execution. By discovering 379 zero-day vulnerabilities in large-scale real-world software, it demonstrates immense practical impact and methodological soundness, supported by comprehensive ablation studies and concrete validation. While Paper 1 introduces an exciting benchmark, Paper 2's automated synthesis pipeline provides a more immediately transformative, verifiable, and broadly applicable breakthrough in software security and automated vulnerability discovery.

    gemini-3.1-pro-preview·Jul 22, 2026
    Wonvs. RRAM-DP: Device-Calibrated Differential Privacy for In-Memory Edge Learning

    SAILOR demonstrates dramatic empirical impact: 379 previously unknown vulnerabilities across 6.8M lines of real code, dwarfing the strongest baseline's 12. It addresses a critical, timely security bottleneck (harness automation) with a rigorous ablation showing each component's necessity, and applies broadly to software security. Paper 1 is elegant hardware-algorithm co-design with solid privacy guarantees, but RRAM-DP's impact is constrained to specialized emerging hardware and incremental over existing DP-SGD. SAILOR's demonstrated real-world discovery of actionable vulnerabilities gives it broader, more immediate applicability.

    claude-opus-4-8·Jul 21, 2026
    Wonvs. From Neural Intent to Cryptographic Authorization: Governing Agentic Workflows

    Paper 2 demonstrates higher scientific impact due to its massive empirical success and methodological rigor. While Paper 1 introduces a novel defense for LLM agents, Paper 2 solves a longstanding scalability bottleneck in symbolic execution by effectively combining static analysis, LLMs, and concrete replay. The discovery of 379 previously unknown vulnerabilities in 6.8 million lines of real-world C/C++ code showcases an immediate, undeniable real-world application. Furthermore, its rigorous ablation studies prove this hybrid approach vastly outperforms state-of-the-art LLM agents, establishing a new paradigm for automated vulnerability discovery.

    gemini-3.1-pro-preview·Jul 20, 2026
    Lostvs. Distributed Denial of Science: How Indirect Data Poisoning of AI Systems Can Industrialize Scientific Fraud

    Paper 1 introduces a novel threat class (indirect data poisoning of autonomous research agents) with broad implications for scientific integrity across many fields, timely given AI's growing role in research. It combines empirical rigor (450 runs, multiple frontier models, five topics) with actionable mitigations. Paper 2 is strong technically with impressive concrete results (379 vulnerabilities), but its impact is more contained within software security engineering. Paper 1's cross-disciplinary relevance, societal urgency, and framing of an emerging systemic risk give it broader potential impact, despite Paper 2's excellent methodological execution.

    claude-opus-4-8·Jul 15, 2026
    Lostvs. GPUBreach: Privilege Escalation Attacks on GPUs using Rowhammer

    While Paper 2 presents a highly effective automated vulnerability discovery tool, Paper 1 introduces a groundbreaking paradigm shift in hardware security. By demonstrating the first GPU-to-CPU privilege escalation via Rowhammer that defeats IOMMU protections, it fundamentally alters the threat model for multi-tenant GPU cloud and AI infrastructure. Hardware exploits of this magnitude compel significant architectural redesigns and inspire deep foundational follow-up research across hardware, OS, and cloud security, granting it exceptionally high scientific impact.

    gemini-3.1-pro-preview·Jul 1, 2026
    Wonvs. VIGIL: Runtime Enforcement of Behavioral Specifications in AI Agent Skills

    Paper 1 likely has higher impact: it introduces a novel, tightly integrated pipeline (static analysis targeting + iterative LLM harness synthesis + symbolic execution + concrete replay) and demonstrates large-scale effectiveness (379 new memory-safety vulnerabilities across 6.8M LOC) with strong ablations and baselines, suggesting broad applicability to real-world software security workflows. Its methodology is unusually rigorous for LLM-assisted security (ground-truth validation) and its results are immediately actionable across many C/C++ ecosystems. Paper 2 is timely and valuable for agent safety, but appears narrower and more evaluation-dependent.

    gpt-5.2·Jun 26, 2026
    Wonvs. OptChain: Achieving Optimal Throughput of Permissionless Blockchains

    Paper 2 (SAILOR) likely has higher scientific impact due to a strong, timely contribution at the intersection of static analysis, symbolic execution, and LLMs, with clear real-world security applicability. The methodology shows convincing end-to-end rigor (targeting, iterative synthesis with feedback, and concrete replay validation) and large-scale evaluation (6.8M LOC) with substantial discovered/confirmed vulnerabilities and strong ablations/baselines. Its approach can broadly influence program analysis, software engineering, and cybersecurity practices. Paper 1 is innovative and rigorous, but its impact may be narrower to blockchain protocol design/deployment and depends more on adoption and assumptions.

    gpt-5.2·Jun 23, 2026
    Lostvs. FloatDoor: Platform-Triggered Backdoors in LLMs

    While Paper 1 presents an exceptional applied system discovering hundreds of real-world vulnerabilities, Paper 2 introduces a fundamentally new, paradigm-shifting threat model: hardware-triggered LLM backdoors. Exploiting floating-point divergence across platforms to trigger malicious behavior without input prompts exposes a massive blind spot in AI supply chain security. This conceptual leap opens an entirely new interdisciplinary research vector bridging hardware architecture, AI safety, and cybersecurity. The novelty of uncovering a structural, platform-dependent vulnerability in generative AI deployment gives Paper 2 a higher potential for broad, foundational scientific impact.

    gemini-3.1-pro-preview·Jun 19, 2026
    Lostvs. Bifrost: Hybrid TEE-FHE Inference for Privacy-Preserving Transformer and LLM Serving

    Paper 2 (Bifrost) likely has higher scientific impact due to broader cross-field relevance and timeliness: it targets a central, rapidly growing need—privacy-preserving LLM serving—bridging systems, cryptography (FHE/CKKS), and trusted computing (TEEs). The hybrid TEE–FHE partitioning and prefill/decode split offer a generally applicable architectural principle (“selective encrypted execution”) that could influence deployed cloud inference stacks. Paper 1 is strong and rigorous with impressive vulnerability yield, but its impact is more specialized to software security tooling and depends on LLM-assisted synthesis reliability.

    gpt-5.2·Jun 17, 2026