{"total":33,"rows":[{"id":"2102.07492","title":"DOBF: A Deobfuscation Pre-Training Objective for Programming Languages","created":"2021-02-15","cited_by_count":68,"area":null},{"id":"2403.05286","title":"LLM4Decompile: Decompiling Binary Code with Large Language Models","created":"2024-03-08","cited_by_count":39,"area":null},{"id":"2305.12520","title":"SLaDe: A Portable Small Language Model Decompiler for Optimized Assembly","created":"2023-05-21","cited_by_count":28,"area":null},{"id":"2301.01701","title":"Extending Source Code Pre-Trained Language Models to Summarise Decompiled Binaries","created":"2023-01-04","cited_by_count":26,"area":null},{"id":"2402.16928","title":"CLAP: Learning Transferable Binary Code Representations with Natural Language Supervision","created":"2024-02-26","cited_by_count":17,"area":null},{"id":"2311.13721","title":"Nova: Generative Language Models for Assembly Code with Hierarchical Attention and Contrastive Learning","created":"2023-11-22","cited_by_count":12,"area":null},{"id":"2405.03991","title":"Assemblage: Automatic Binary Dataset Construction for Machine Learning","created":"2024-05-07","cited_by_count":12,"area":null},{"id":"2112.02650","title":"VarCLR: Variable Semantic Representation Pre-training via Contrastive Learning","created":"2021-12-05","cited_by_count":11,"area":null},{"id":"2301.00969","title":"Boosting Neural Networks to Decompile Optimized Binaries","created":"2023-01-03","cited_by_count":11,"area":null},{"id":"2405.19581","title":"Source Code Foundation Models are Transferable Binary Analysis Knowledge Bases","created":"2024-05-30","cited_by_count":8,"area":null},{"id":"2103.12801","title":"Variable Name Recovery in Decompiled Binary Code using Constrained Masked Language Modeling","created":"2021-03-23","cited_by_count":7,"area":null},{"id":"2210.05102","title":"Pre-Training Representations of Binary Code Using Contrastive Learning","created":"2022-10-11","cited_by_count":6,"area":null},{"id":"2312.05275","title":"Exploring the Limits of ChatGPT in Software Security Applications","created":"2023-12-08","cited_by_count":6,"area":null},{"id":"2107.13404","title":"XFL: Naming Functions in Binaries with Extreme Multi-label Learning","created":"2021-07-28","cited_by_count":5,"area":null},{"id":"2504.00019","title":"ObscuraCoder: Powering Efficient Code LM Pre-Training Via Obfuscation Grounding","created":"2025-03-27","cited_by_count":4,"area":null},{"id":"2109.10476","title":"Self-Supervised Learning to Prove Equivalence Between Straight-Line Programs via Rewrite Rules","created":"2021-09-22","cited_by_count":3,"area":null},{"id":"2202.04847","title":"A Survey on Artificial Intelligence for Source Code: A Dialogue Systems Perspective","created":"2022-02-10","cited_by_count":3,"area":null},{"id":"2406.17233","title":"Self-Constructed Context Decompilation with Fined-grained Alignment Enhancement","created":"2024-06-25","cited_by_count":3,"area":null},{"id":"2409.07889","title":"BLens: Contrastive Captioning of Binary Functions using Ensemble Embedding","created":"2024-09-12","cited_by_count":3,"area":null},{"id":"2106.02452","title":"Proving Equivalence Between Complex Expressions Using Graph-to-Sequence Neural Models","created":"2021-06-01","cited_by_count":2,"area":null},{"id":"2501.04811","title":"Fast, Fine-Grained Equivalence Checking for Neural Decompilers","created":"2025-01-08","cited_by_count":2,"area":null},{"id":"2304.03854","title":"Revisiting Deep Learning for Variable Type Recovery","created":"2023-04-07","cited_by_count":1,"area":null},{"id":"2509.25514","title":"AGNOMIN -- Architecture Agnostic Multi-Label Function Name Prediction","created":"2025-09-29","cited_by_count":1,"area":null},{"id":"2511.01763","title":"Context-Guided Decompilation: A Step Towards Re-executability","created":"2025-11-03","cited_by_count":1,"area":null},{"id":"2604.27319","title":"REBENCH: A Procedural, Fair-by-Construction Benchmark for LLMs on Stripped-Binary Types and Names (Extended Version)","created":"2026-04-30","cited_by_count":1,"area":null},{"id":"2605.11501","title":"Decaf: Improving Neural Decompilation with Automatic Feedback and Search","created":"2026-05-12","cited_by_count":1,"area":null},{"id":"2308.08203","title":"Epicure: Distilling Sequence Model Predictions into Patterns","created":"2023-08-16","cited_by_count":0,"area":null},{"id":"2312.04731","title":"STraceBERT: Source Code Retrieval using Semantic Application Traces","created":"2023-12-07","cited_by_count":0,"area":null},{"id":"2512.00134","title":"Asm2SrcEval: Evaluating Large Language Models for Assembly-to-Source Code Translation","created":"2025-11-28","cited_by_count":0,"area":null},{"id":"2512.01141","title":"Neural Variable Name Repair: Learning to Rename Identifiers for Readability","created":"2025-11-30","cited_by_count":0,"area":null},{"id":"2603.14855","title":"PCodeTrans: Translate Decompiled Pseudocode to Compilable and Executable Equivalent","created":"2026-03-16","cited_by_count":0,"area":null},{"id":"2606.17398","title":"SoK: AI-Augmented Binary Reversing","created":"2026-06-16","cited_by_count":0,"area":null},{"id":"2609.05370","title":"When LLM Decompilers Recompile More and Preserve Less","created":"2026-09-04","cited_by_count":0,"area":null}],"next_cursor":null}