mlsanityData to 7 Oct 2026

PCodeTrans: Translate Decompiled Pseudocode to Compilable and Executable Equivalent

arXiv 2603.14855 ↗First posted 16 Mar 2026cs.SE cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Decompilation is foundational to binary analysis, yet conventional tools prioritize human readability over strict recompilability and verifiable runtime correctness. While recent LLM-based approaches attempt to refine decompiled pseudocode, they typically either optimize solely for readability or rely on static analysis for evaluation. This makes them prone to "semantic hallucinations" that compromise accuracy and fail to resolve actual runtime failures. For critical tasks like software modernization and vulnerability remediation, recovered code must not only compile but replicate the original binary's behavior. We present PCodeTrans, a feedback-driven framework that bridges the gap between decompilation, recompilation, and rigorous function-level dynamic validation. After extracting a minimal yet coherent context to guarantee recompilability, PCodeTrans employs an in situ substitutable engine to hot-swap the compiled function directly into the unmodified binary, natively preserving its authentic execution context and global dependencies. Guided by fine-grained differential tracing, PCodeTrans generates precise runtime feedback to iteratively guide an LLM in repairing semantic discrepancies. Evaluated on Coreutils and Binutils, PCodeTrans achieves unprecedented recovery performance when rectifying raw Hex-Rays outputs, attaining 100% function-level compilability on unstripped binaries alongside 99.55% and 99.89% test-validated behavioral consistency, respectively. In doing so, it resolves 76.56% and 79.74% of logic errors exposed by official test suites. Exhibiting exceptional resilience, PCodeTrans maintains over 96% behavioral consistency even on fully stripped binaries. By significantly outperforming all existing baselines, PCodeTrans paves a practical path to reliably translate decompiled pseudocode into compilable and executable equivalents.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 17 of its 46 references that are in the map. First posted on arXiv 16 Mar 2026.

Builds on

17 of 46 references.

References · 17

  1. 2023Split and Merge: Aligning Position Biases in LLM-based Evaluatorscited by 71
  2. 2024LLM4Decompile: Decompiling Binary Code with Large Language Modelscited by 38
  3. 2019DIRE: A Neural Approach to Decompiled Identifier Namingcited by 36
  4. 2021Augmenting Decompiler Output with Learned Variable Names and Typescited by 23
  5. 2019Towards Neural Decompilationcited by 15
  6. 2023Benchmarking and Explaining Large Language Model-based Code Generation: A Causality-Centric Approachcited by 15
  7. 2022Decompiling x86 Deep Neural Network Executablescited by 7
  8. 2025SK2Decompile: LLM-based Two-Phase Binary Decompilation from Skeleton to Skincited by 7
  9. 2016Polymorphic Type Inference for Machine Codecited by 5
  10. 2025D-LiFT: Improving LLM-based Decompiler Backend via Code Quality-driven Fine-tuningcited by 5
  11. 2022Automatically Mitigating Vulnerabilities in Binary Programs via Partially Recompilable Decompilationcited by 4
  12. 2025DecompileBench: A Comprehensive Benchmark for Evaluating Decompilers in Real-World Scenarioscited by 4
5 more
  1. 2025ReCopilot: Reverse Engineering Copilot in Binary Analysiscited by 4
  2. 2025ALT4Decompile: Inferring C-aligned Abstract Loop Tree for LLM-Based Binary Decompilationcited by 4
  3. 2025The CodeInverter Suite: Structure- and Data-Aware Binary Decompilation with Efficient LLMscited by 2
  4. 2025FidelityGPT: Correcting Decompilation Distortions with Retrieval Augmented Generationcited by 2
  5. 2025Context-Guided Decompilation: A Step Towards Re-executabilitycited by 1

Built on by

Not cited yet.