{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/code-completion/papers/2","list_of":"/task/code-completion","task":"Code Completion","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":3,"rows_per_page":100,"rows":[101,200],"of":212,"counts":{"archive_papers_tagged":212,"with_a_code_link":108,"where_syntology_ran_a_sample":42,"not_listed_spam_title":0,"listed":212,"listed_where_code_ran":42,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":34,"every_run_a_failure_of_syntologys_instrument":8,"listed_with_a_run_with_no_instrument_failure":34,"listed_every_run_a_failure_of_syntologys_instrument":8,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/code-completion","prev":"/task/code-completion","next":"/task/code-completion/papers/3","papers":[{"url":"/paper/empirical-study-of-transformers-for-source","slug":"empirical-study-of-transformers-for-source","title":"Empirical Study of Transformers for Source Code","date":"2020-10-15","arxiv_id":"2010.07987","repositories_listed":1,"syntology":null},{"url":"/paper/graphcodebert-pre-training-code","slug":"graphcodebert-pre-training-code","title":"GraphCodeBERT: Pre-training Code Representations with Data Flow","date":"2020-09-17","arxiv_id":"2009.08366","repositories_listed":1,"syntology":null},{"url":"/paper/lambdanet-probabilistic-type-inference-using-1","slug":"lambdanet-probabilistic-type-inference-using-1","title":"LambdaNet: Probabilistic Type Inference using Graph Neural Networks","date":"2020-04-29","arxiv_id":"2005.02161","repositories_listed":1,"syntology":null},{"url":"/paper/adversarial-robustness-for-code","slug":"adversarial-robustness-for-code","title":"Adversarial Robustness for Code","date":"2020-02-11","arxiv_id":"2002.04694","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/adversarial-robustness-for-code#ran","syntology_url":"https://syntology.ai/paper/2002.04694","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.04694"}},"official":null}},{"url":"/paper/pythia-ai-assisted-code-completion-system","slug":"pythia-ai-assisted-code-completion-system","title":"Pythia: AI-assisted Code Completion System","date":"2019-11-29","arxiv_id":"1912.00742","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/pythia-ai-assisted-code-completion-system#ran","syntology_url":"https://syntology.ai/paper/1912.00742","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.00742"}},"official":{"repos":["Microsoft/PTVS"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/codegru-context-aware-deep-learning-with","slug":"codegru-context-aware-deep-learning-with","title":"CodeGRU: Context-aware Deep Learning with Gated Recurrent Unit for Source Code Modeling","date":"2019-03-03","arxiv_id":"1903.00884","repositories_listed":1,"syntology":null},{"url":"/paper/eclipse-cdt-code-analysis-and-unit-testing","slug":"eclipse-cdt-code-analysis-and-unit-testing","title":"Eclipse CDT code analysis and unit testing","date":"2018-11-15","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/code-completion-with-neural-attention-and","slug":"code-completion-with-neural-attention-and","title":"Code Completion with Neural Attention and Pointer Networks","date":"2017-11-27","arxiv_id":"1711.09573","repositories_listed":1,"syntology":null},{"url":null,"slug":"beyond-autocomplete-designing-copilotlens","title":"Beyond Autocomplete: Designing CopilotLens Towards Transparent and Explainable AI Coding Agents","date":"2025-06-24","arxiv_id":"2506.20062","repositories_listed":0,"syntology":null},{"url":"/paper/plan-for-speed-dilated-scheduling-for-masked","slug":"plan-for-speed-dilated-scheduling-for-masked","title":"Plan for Speed -- Dilated Scheduling for Masked Diffusion Language Models","date":"2025-06-23","arxiv_id":"2506.19037","repositories_listed":0,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":4,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/plan-for-speed-dilated-scheduling-for-masked#ran","syntology_url":"https://syntology.ai/paper/2506.19037","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2506.19037"}},"official":null}},{"url":null,"slug":"hilde-intentional-code-generation-via-human","title":"HiLDe: Intentional Code Generation via Human-in-the-Loop Decoding","date":"2025-05-28","arxiv_id":"2505.22906","repositories_listed":0,"syntology":null},{"url":null,"slug":"alignment-augmented-speculative-decoding-with","title":"Alignment-Augmented Speculative Decoding with Alignment Sampling and Conditional Verification","date":"2025-05-19","arxiv_id":"2505.13204","repositories_listed":0,"syntology":null},{"url":null,"slug":"structure-aware-corpus-construction-and-user","title":"Structure-Aware Corpus Construction and User-Perception-Aligned Metrics for Large-Language-Model Code Completion","date":"2025-05-19","arxiv_id":"2505.13073","repositories_listed":0,"syntology":null},{"url":null,"slug":"codemixbench-evaluating-large-language-models","title":"CodeMixBench: Evaluating Large Language Models on Code Generation with Code-Mixed Prompts","date":"2025-05-08","arxiv_id":"2505.05063","repositories_listed":0,"syntology":null},{"url":null,"slug":"procedural-memory-is-not-all-you-need","title":"Procedural Memory Is Not All You Need: Bridging Cognitive Gaps in LLM-Based Agents","date":"2025-05-06","arxiv_id":"2505.03434","repositories_listed":0,"syntology":null},{"url":null,"slug":"akd-adversarial-knowledge-distillation-for","title":"AKD : Adversarial Knowledge Distillation For Large Language Models Alignment on Coding tasks","date":"2025-05-05","arxiv_id":"2505.06267","repositories_listed":0,"syntology":null},{"url":"/paper/noesis-differentially-private-knowledge","slug":"noesis-differentially-private-knowledge","title":"NoEsis: Differentially Private Knowledge Transfer in Modular LLM Adaptation","date":"2025-04-25","arxiv_id":"2504.18147","repositories_listed":0,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/noesis-differentially-private-knowledge#ran","syntology_url":"https://syntology.ai/paper/2504.18147","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2504.18147"}},"official":null}},{"url":null,"slug":"edubot-can-llms-solve-personalized-learning","title":"EduBot -- Can LLMs Solve Personalized Learning and Programming Assignments?","date":"2025-04-23","arxiv_id":"2504.17824","repositories_listed":0,"syntology":null},{"url":null,"slug":"rtlrepocoder-repository-level-rtl-code","title":"RTLRepoCoder: Repository-Level RTL Code Completion through the Combination of Fine-Tuning and Retrieval Augmentation","date":"2025-04-11","arxiv_id":"2504.08862","repositories_listed":0,"syntology":null},{"url":null,"slug":"ccci-code-completion-with-contextual","title":"CCCI: Code Completion with Contextual Information for Complex Data Transfer Tasks Using Large Language Models","date":"2025-03-29","arxiv_id":"2503.23231","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-explaining-large-language-models-for-code","title":"On Explaining (Large) Language Models For Code Using Global Code-Based Explanations","date":"2025-03-21","arxiv_id":"2503.16771","repositories_listed":0,"syntology":null},{"url":"/paper/fea-bench-a-benchmark-for-evaluating","slug":"fea-bench-a-benchmark-for-evaluating","title":"FEA-Bench: A Benchmark for Evaluating Repository-Level Code Generation for Feature Implementation","date":"2025-03-09","arxiv_id":"2503.06680","repositories_listed":0,"syntology":{"n":16,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/fea-bench-a-benchmark-for-evaluating#ran","syntology_url":"https://syntology.ai/paper/2503.06680","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2503.06680"}},"official":null}},{"url":null,"slug":"genai-for-simulation-model-in-model-based","title":"GenAI for Simulation Model in Model-Based Systems Engineering","date":"2025-03-09","arxiv_id":"2503.06422","repositories_listed":0,"syntology":null},{"url":null,"slug":"2503-01098","title":"SolBench: A Dataset and Benchmark for Evaluating Functional Correctness in Solidity Code Completion and Repair","date":"2025-03-03","arxiv_id":"2503.01098","repositories_listed":0,"syntology":null},{"url":null,"slug":"alchemist-towards-the-design-of-efficient","title":"Alchemist: Towards the Design of Efficient Online Continual Learning System","date":"2025-03-03","arxiv_id":"2503.01066","repositories_listed":0,"syntology":null},{"url":null,"slug":"automated-code-generation-and-validation-for","title":"Automated Code Generation and Validation for Software Components of Microcontrollers","date":"2025-02-26","arxiv_id":"2502.18905","repositories_listed":0,"syntology":null},{"url":null,"slug":"comparative-analysis-of-large-language-models","title":"Comparative Analysis of Large Language Models for Context-Aware Code Completion using SAFIM Framework","date":"2025-02-21","arxiv_id":"2502.15243","repositories_listed":0,"syntology":null},{"url":null,"slug":"mechanistic-understanding-of-language-models","title":"Mechanistic Understanding of Language Models in Syntactic Code Completion","date":"2025-02-20","arxiv_id":"2502.18499","repositories_listed":0,"syntology":null},{"url":null,"slug":"mathfimer-enhancing-mathematical-reasoning-by","title":"MathFimer: Enhancing Mathematical Reasoning by Expanding Reasoning Steps through Fill-in-the-Middle Task","date":"2025-02-17","arxiv_id":"2502.11684","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-fim-code-completions-via-context","title":"Improving FIM Code Completions via Context & Curriculum Based Learning","date":"2024-12-21","arxiv_id":"2412.16589","repositories_listed":0,"syntology":null},{"url":null,"slug":"execrepobench-multi-level-executable-code","title":"ExecRepoBench: Multi-level Executable Code Completion Evaluation","date":"2024-12-16","arxiv_id":"2412.11990","repositories_listed":0,"syntology":null},{"url":null,"slug":"contextmodule-improving-code-completion-via","title":"ContextModule: Improving Code Completion via Repository-level Contextual Information","date":"2024-12-11","arxiv_id":"2412.08063","repositories_listed":0,"syntology":null},{"url":null,"slug":"protect-your-secrets-understanding-and","title":"Protect Your Secrets: Understanding and Measuring Data Exposure in VSCode Extensions","date":"2024-12-01","arxiv_id":"2412.00707","repositories_listed":0,"syntology":null},{"url":null,"slug":"libevolutioneval-a-benchmark-and-study-for","title":"LibEvolutionEval: A Benchmark and Study for Version-Specific Code Generation","date":"2024-11-19","arxiv_id":"2412.04478","repositories_listed":0,"syntology":null},{"url":null,"slug":"fastdraft-how-to-train-your-draft","title":"FastDraft: How to Train Your Draft","date":"2024-11-17","arxiv_id":"2411.11055","repositories_listed":0,"syntology":null},{"url":null,"slug":"cocop-enhancing-text-classification-with-llm","title":"CoCoP: Enhancing Text Classification with LLM through Code Completion Prompt","date":"2024-11-13","arxiv_id":"2411.08979","repositories_listed":0,"syntology":null},{"url":null,"slug":"judgerank-leveraging-large-language-models","title":"JudgeRank: Leveraging Large Language Models for Reasoning-Intensive Reranking","date":"2024-10-31","arxiv_id":"2411.00142","repositories_listed":0,"syntology":null},{"url":null,"slug":"m2rc-eval-massively-multilingual-repository","title":"M2rc-Eval: Massively Multilingual Repository-level Code Completion Evaluation","date":"2024-10-28","arxiv_id":"2410.21157","repositories_listed":0,"syntology":null},{"url":null,"slug":"codecipher-learning-to-obfuscate-source-code","title":"CodeCipher: Learning to Obfuscate Source Code Against LLMs","date":"2024-10-08","arxiv_id":"2410.05797","repositories_listed":0,"syntology":null},{"url":null,"slug":"horizon-length-prediction-advancing-fill-in","title":"Horizon-Length Prediction: Advancing Fill-in-the-Middle Capabilities for Code Generation with Lookahead Planning","date":"2024-10-04","arxiv_id":"2410.03103","repositories_listed":0,"syntology":null},{"url":null,"slug":"marscode-agent-ai-native-automated-bug-fixing","title":"MarsCode Agent: AI-native Automated Bug Fixing","date":"2024-09-02","arxiv_id":"2409.00899","repositories_listed":0,"syntology":null},{"url":null,"slug":"statically-contextualizing-large-language","title":"Statically Contextualizing Large Language Models with Typed Holes","date":"2024-09-02","arxiv_id":"2409.00921","repositories_listed":0,"syntology":null},{"url":null,"slug":"retrieval-augmented-code-completion-for-local","title":"Retrieval-augmented code completion for local projects using large language models","date":"2024-08-09","arxiv_id":"2408.05026","repositories_listed":0,"syntology":null},{"url":null,"slug":"repomastereval-evaluating-code-completion-via","title":"RepoMasterEval: Evaluating Code Completion via Real-World Repositories","date":"2024-08-07","arxiv_id":"2408.03519","repositories_listed":0,"syntology":null},{"url":null,"slug":"2408-02509","title":"Black-Box Adversarial Attacks on LLM-Based Code Completion","date":"2024-08-05","arxiv_id":"2408.02509","repositories_listed":0,"syntology":null},{"url":null,"slug":"2407-21227","title":"TaskEval: Assessing Difficulty of Code Generation Tasks for Large Language Models","date":"2024-07-30","arxiv_id":"2407.21227","repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluating-long-range-dependency-handling-in","title":"Evaluating Long Range Dependency Handling in Code Generation Models using Multi-Step Key Retrieval","date":"2024-07-23","arxiv_id":"2407.21049","repositories_listed":0,"syntology":null},{"url":null,"slug":"curriculum-learning-for-small-code-language","title":"Curriculum Learning for Small Code Language Models","date":"2024-07-14","arxiv_id":"2407.10194","repositories_listed":0,"syntology":null},{"url":null,"slug":"tapi-towards-target-specific-and-adversarial","title":"TPIA: Towards Target-specific Prompt Injection Attack against Code-oriented Large Language Models","date":"2024-07-12","arxiv_id":"2407.09164","repositories_listed":0,"syntology":null},{"url":null,"slug":"jailbreak-attacks-and-defenses-against-large","title":"Jailbreak Attacks and Defenses Against Large Language Models: A Survey","date":"2024-07-05","arxiv_id":"2407.04295","repositories_listed":0,"syntology":null},{"url":null,"slug":"codegemma-open-code-models-based-on-gemma","title":"CodeGemma: Open Code Models Based on Gemma","date":"2024-06-17","arxiv_id":"2406.11409","repositories_listed":0,"syntology":null},{"url":null,"slug":"measuring-memorization-in-rlhf-for-code","title":"Measuring memorization in RLHF for code completion","date":"2024-06-17","arxiv_id":"2406.11715","repositories_listed":0,"syntology":null},{"url":"/paper/chain-of-agents-large-language-models","slug":"chain-of-agents-large-language-models","title":"Chain of Agents: Large Language Models Collaborating on Long-Context Tasks","date":"2024-06-04","arxiv_id":"2406.02818","repositories_listed":0,"syntology":null},{"url":null,"slug":"r2c2-coder-enhancing-and-benchmarking-real","title":"R2C2-Coder: Enhancing and Benchmarking Real-world Repository-level Code Completion Abilities of Code Large Language Models","date":"2024-06-03","arxiv_id":"2406.01359","repositories_listed":0,"syntology":null},{"url":null,"slug":"model-cascading-for-code-reducing-inference","title":"Model Cascading for Code: A Cascaded Black-Box Multi-Model Framework for Cost-Efficient Code Completion with Self-Testing","date":"2024-05-24","arxiv_id":"2405.15842","repositories_listed":0,"syntology":null},{"url":null,"slug":"full-line-code-completion-bringing-ai-to","title":"Full Line Code Completion: Bringing AI to Desktop","date":"2024-05-14","arxiv_id":"2405.08704","repositories_listed":0,"syntology":null},{"url":null,"slug":"rethinking-software-engineering-in-the","title":"Rethinking Software Engineering in the Foundation Model Era: From Task-Driven AI Copilots to Goal-Driven AI Pair Programmers","date":"2024-04-16","arxiv_id":"2404.10225","repositories_listed":0,"syntology":null},{"url":null,"slug":"is-next-token-prediction-sufficient-for-gpt","title":"Is Next Token Prediction Sufficient for GPT? Exploration on Code Logic Comprehension","date":"2024-04-13","arxiv_id":"2404.08885","repositories_listed":0,"syntology":null},{"url":null,"slug":"stable-code-technical-report","title":"Stable Code Technical Report","date":"2024-04-01","arxiv_id":"2404.01226","repositories_listed":0,"syntology":null},{"url":null,"slug":"repoformer-selective-retrieval-for-repository","title":"Repoformer: Selective Retrieval for Repository-Level Code Completion","date":"2024-03-15","arxiv_id":"2403.10059","repositories_listed":0,"syntology":null},{"url":null,"slug":"token-alignment-via-character-matching-for","title":"Token Alignment via Character Matching for Subword Completion","date":"2024-03-13","arxiv_id":"2403.08688","repositories_listed":0,"syntology":null},{"url":null,"slug":"ansible-lightspeed-a-code-generation-service","title":"Insights from the Usage of the Ansible Lightspeed Code Completion Service","date":"2024-02-27","arxiv_id":"2402.17442","repositories_listed":0,"syntology":null},{"url":null,"slug":"repofuse-repository-level-code-completion","title":"REPOFUSE: Repository-Level Code Completion with Fused Dual Context","date":"2024-02-22","arxiv_id":"2402.14323","repositories_listed":0,"syntology":null},{"url":null,"slug":"context-composing-for-full-line-code","title":"Context Composing for Full Line Code Completion","date":"2024-02-14","arxiv_id":"2402.09230","repositories_listed":0,"syntology":null},{"url":null,"slug":"do-large-code-models-understand-programming","title":"Do Large Code Models Understand Programming Concepts? Counterfactual Analysis for Code Predicates","date":"2024-02-08","arxiv_id":"2402.05980","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-models-for-source-code-synthesis-and","title":"Neural Models for Source Code Synthesis and Completion","date":"2024-02-08","arxiv_id":"2402.06690","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-llm-based-coding-tools-through","title":"Enhancing LLM-Based Coding Tools through Native Integration of IDE-Derived Static Context","date":"2024-02-06","arxiv_id":"2402.03630","repositories_listed":0,"syntology":null},{"url":null,"slug":"ompgpt-a-generative-pre-trained-transformer","title":"OMPGPT: A Generative Pre-trained Transformer Model for OpenMP","date":"2024-01-28","arxiv_id":"2401.16445","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-review-of-repository-level-prompting-for","title":"A Review of Repository Level Prompting for LLMs","date":"2023-12-15","arxiv_id":"2312.10101","repositories_listed":0,"syntology":null},{"url":null,"slug":"interpretability-illusions-in-the","title":"Interpretability Illusions in the Generalization of Simplified Models","date":"2023-12-06","arxiv_id":"2312.03656","repositories_listed":0,"syntology":null},{"url":null,"slug":"past-as-a-guide-leveraging-retrospective","title":"Past as a Guide: Leveraging Retrospective Learning for Python Code Completion","date":"2023-11-13","arxiv_id":"2311.07635","repositories_listed":0,"syntology":null},{"url":null,"slug":"identifying-and-mitigating-vulnerabilities-in","title":"Identifying and Mitigating Vulnerabilities in LLM-Integrated Applications","date":"2023-11-07","arxiv_id":"2311.16153","repositories_listed":0,"syntology":null},{"url":null,"slug":"attention-alignment-and-flexible-positional","title":"Attention Alignment and Flexible Positional Embeddings Improve Transformer Length Extrapolation","date":"2023-11-01","arxiv_id":"2311.00684","repositories_listed":0,"syntology":null},{"url":null,"slug":"critique-ability-of-large-language-models","title":"Critique Ability of Large Language Models","date":"2023-10-07","arxiv_id":"2310.04815","repositories_listed":0,"syntology":null},{"url":null,"slug":"laminar-a-new-serverless-stream-based","title":"Laminar: A New Serverless Stream-based Framework with Semantic Code Search and Code Completion","date":"2023-09-01","arxiv_id":"2309.00584","repositories_listed":0,"syntology":null},{"url":null,"slug":"identifying-and-mitigating-the-security-risks","title":"Identifying and Mitigating the Security Risks of Generative AI","date":"2023-08-28","arxiv_id":"2308.14840","repositories_listed":0,"syntology":null},{"url":null,"slug":"benchmarking-causal-study-to-interpret-large","title":"Benchmarking Causal Study to Interpret Large Language Models for Source Code","date":"2023-08-23","arxiv_id":"2308.12415","repositories_listed":0,"syntology":null},{"url":null,"slug":"securefalcon-the-next-cyber-reasoning-system","title":"SecureFalcon: Are We There Yet in Automated Software Vulnerability Detection with LLMs?","date":"2023-07-13","arxiv_id":"2307.06616","repositories_listed":0,"syntology":null},{"url":null,"slug":"natural-language-generation-and-understanding","title":"Natural Language Generation and Understanding of Big Code for AI-Assisted Programming: A Review","date":"2023-07-04","arxiv_id":"2307.02503","repositories_listed":0,"syntology":null},{"url":null,"slug":"repofusion-training-code-models-to-understand","title":"RepoFusion: Training Code Models to Understand Your Repository","date":"2023-06-19","arxiv_id":"2306.10998","repositories_listed":0,"syntology":null},{"url":"/paper/a-static-evaluation-of-code-completion-by","slug":"a-static-evaluation-of-code-completion-by","title":"A Static Evaluation of Code Completion by Large Language Models","date":"2023-06-05","arxiv_id":"2306.03203","repositories_listed":0,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-static-evaluation-of-code-completion-by#ran","syntology_url":"https://syntology.ai/paper/2306.03203","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2306.03203"}},"official":null}},{"url":null,"slug":"better-context-makes-better-code-language","title":"Better Context Makes Better Code Language Models: A Case Study on Function Call Argument Completion","date":"2023-06-01","arxiv_id":"2306.00381","repositories_listed":0,"syntology":null},{"url":null,"slug":"coeditor-leveraging-contextual-changes-for","title":"Coeditor: Leveraging Contextual Changes for Multi-round Code Auto-editing","date":"2023-05-29","arxiv_id":"2305.18584","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-machine-translation-for-code","title":"Neural Machine Translation for Code Generation","date":"2023-05-22","arxiv_id":"2305.13504","repositories_listed":0,"syntology":null},{"url":"/paper/tasty-a-transformer-based-approach-to-space","slug":"tasty-a-transformer-based-approach-to-space","title":"TASTY: A Transformer based Approach to Space and Time complexity","date":"2023-05-06","arxiv_id":"2305.05379","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-copilot-to-pilot-towards-ai-supported","title":"From Copilot to Pilot: Towards AI Supported Software Development","date":"2023-03-07","arxiv_id":"2303.04142","repositories_listed":0,"syntology":null},{"url":null,"slug":"generation-probabilities-are-not-enough","title":"Generation Probabilities Are Not Enough: Uncertainty Highlighting in AI Code Completions","date":"2023-02-14","arxiv_id":"2302.07248","repositories_listed":0,"syntology":null},{"url":null,"slug":"serenity-library-based-python-code-analysis","title":"Serenity: Library Based Python Code Analysis for Code Completion and Automated Machine Learning","date":"2023-01-05","arxiv_id":"2301.05108","repositories_listed":0,"syntology":null},{"url":null,"slug":"is-self-attention-powerful-to-learn-code","title":"Unveiling Code Pre-Trained Models: Investigating Syntax and Semantics Capacities","date":"2022-12-20","arxiv_id":"2212.10017","repositories_listed":0,"syntology":null},{"url":null,"slug":"multicoder-multi-programming-lingual-pre","title":"MultiCoder: Multi-Programming-Lingual Pre-Training for Low-Resource Code Completion","date":"2022-12-19","arxiv_id":"2212.09666","repositories_listed":0,"syntology":null},{"url":null,"slug":"text-and-patterns-for-effective-chain-of","title":"Text and Patterns: For Effective Chain of Thought, It Takes Two to Tango","date":"2022-09-16","arxiv_id":"2209.07686","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-represent-programs-with-code","title":"HierarchyNet: Learning to Summarize Source Code with Heterogeneous Representations","date":"2022-05-31","arxiv_id":"2205.15479","repositories_listed":0,"syntology":null},{"url":null,"slug":"all-you-need-is-logs-improving-code","title":"All You Need Is Logs: Improving Code Completion by Learning from Anonymous IDE Usage Logs","date":"2022-05-21","arxiv_id":"2205.10692","repositories_listed":0,"syntology":null},{"url":null,"slug":"compilable-neural-code-generation-with","title":"Compilable Neural Code Generation with Compiler Feedback","date":"2022-03-10","arxiv_id":"2203.05132","repositories_listed":0,"syntology":null},{"url":null,"slug":"can-openai-codex-and-other-large-language","title":"Examining Zero-Shot Vulnerability Repair with Large Language Models","date":"2021-12-03","arxiv_id":"2112.02125","repositories_listed":0,"syntology":null},{"url":null,"slug":"long-range-modeling-of-source-code-files-with","title":"Long-Range Modeling of Source Code Files with eWASH: Extended Window Access by Syntax Hierarchy","date":"2021-09-17","arxiv_id":"2109.08780","repositories_listed":0,"syntology":null},{"url":null,"slug":"toward-less-hidden-cost-of-code-completion","title":"Toward Less Hidden Cost of Code Completion with Acceptance and Ranking Models","date":"2021-06-26","arxiv_id":"2106.13928","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-generate-code-sketches","title":"Learning to Complete Code with Sketches","date":"2021-06-18","arxiv_id":"2106.10158","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-extend-program-graphs-to-work-in","title":"Learning to Extend Program Graphs to Work-in-Progress Code","date":"2021-05-28","arxiv_id":"2105.14038","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-code-autocompletion-with-transfer","title":"Improving Code Autocompletion with Transfer Learning","date":"2021-05-12","arxiv_id":"2105.05991","repositories_listed":0,"syntology":null}],"record_sha256":"bd9ec78b2b0233db88ee4c4b6e844caf5e884dd70e4be7594407f657a447d1af","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}