{"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-generation/papers/13","list_of":"/task/code-generation","task":"Code Generation","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":13,"pages_in_order":17,"rows_per_page":100,"rows":[1201,1300],"of":1697,"counts":{"archive_papers_tagged":1697,"with_a_code_link":745,"where_syntology_ran_a_sample":280,"not_listed_spam_title":0,"listed":1697,"listed_where_code_ran":280,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":238,"every_run_a_failure_of_syntologys_instrument":42,"listed_with_a_run_with_no_instrument_failure":238,"listed_every_run_a_failure_of_syntologys_instrument":42,"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-generation","prev":"/task/code-generation/papers/12","next":"/task/code-generation/papers/14","papers":[{"url":null,"slug":"sparsepo-controlling-preference-alignment-of","title":"SparsePO: Controlling Preference Alignment of LLMs via Sparse Token Masks","date":"2024-10-07","arxiv_id":"2410.05102","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-evaluation-of-llm-code-generation","title":"An evaluation of LLM code generation capabilities through graded exercises","date":"2024-10-06","arxiv_id":"2410.16292","repositories_listed":0,"syntology":null},{"url":null,"slug":"aime-ai-system-optimization-via-multiple-llm","title":"AIME: AI System Optimization via Multiple LLM Evaluators","date":"2024-10-04","arxiv_id":"2410.03131","repositories_listed":0,"syntology":null},{"url":null,"slug":"generating-equivalent-representations-of-code","title":"Generating Equivalent Representations of Code By A Self-Reflection Approach","date":"2024-10-04","arxiv_id":"2410.03351","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":"showing-llm-generated-code-selectively-based","title":"Showing LLM-Generated Code Selectively Based on Confidence of LLMs","date":"2024-10-04","arxiv_id":"2410.03234","repositories_listed":0,"syntology":null},{"url":null,"slug":"survey-on-code-generation-for-low-resource","title":"A Survey on LLM-based Code Generation for Low-Resource and Domain-Specific Programming Languages","date":"2024-10-04","arxiv_id":"2410.03981","repositories_listed":0,"syntology":null},{"url":null,"slug":"graphic-a-graph-based-in-context-example","title":"GraphIC: A Graph-Based In-Context Example Retrieval Model for Multi-Step Reasoning","date":"2024-10-03","arxiv_id":"2410.02203","repositories_listed":0,"syntology":null},{"url":null,"slug":"not-all-llm-reasoners-are-created-equal","title":"Not All LLM Reasoners Are Created Equal","date":"2024-10-02","arxiv_id":"2410.01748","repositories_listed":0,"syntology":null},{"url":null,"slug":"scidoc2diagrammer-maf-towards-generation-of","title":"SciDoc2Diagrammer-MAF: Towards Generation of Scientific Diagrams from Documents guided by Multi-Aspect Feedback Refinement","date":"2024-09-28","arxiv_id":"2409.19242","repositories_listed":0,"syntology":null},{"url":null,"slug":"artificial-intelligence-generated-code","title":"Artificial-Intelligence Generated Code Considered Harmful: A Road Map for Secure and High-Quality Code Generation","date":"2024-09-27","arxiv_id":"2409.19182","repositories_listed":0,"syntology":null},{"url":null,"slug":"hm3-hierarchical-multi-objective-model","title":"HM3: Hierarchical Multi-Objective Model Merging for Pretrained Models","date":"2024-09-27","arxiv_id":"2409.18893","repositories_listed":0,"syntology":null},{"url":null,"slug":"code-generation-and-algorithmic-problem","title":"Code Generation and Algorithmic Problem Solving Using Llama 3.1 405B","date":"2024-09-26","arxiv_id":"2409.19027","repositories_listed":0,"syntology":null},{"url":null,"slug":"compositional-hardness-of-code-in-large","title":"Compositional Hardness of Code in Large Language Models -- A Probabilistic Perspective","date":"2024-09-26","arxiv_id":"2409.18028","repositories_listed":0,"syntology":null},{"url":null,"slug":"selection-of-prompt-engineering-techniques","title":"Selection of Prompt Engineering Techniques for Code Generation through Predicting Code Complexity","date":"2024-09-24","arxiv_id":"2409.16416","repositories_listed":0,"syntology":null},{"url":null,"slug":"task-oriented-prompt-enhancement-via-script","title":"Task-oriented Prompt Enhancement via Script Generation","date":"2024-09-24","arxiv_id":"2409.16418","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-comprehensive-framework-for-evaluating-api","title":"A Comprehensive Framework for Evaluating API-oriented Code Generation in Large Language Models","date":"2024-09-23","arxiv_id":"2409.15228","repositories_listed":0,"syntology":null},{"url":null,"slug":"eliciting-instruction-tuned-code-language","title":"Eliciting Instruction-tuned Code Language Models' Capabilities to Utilize Auxiliary Function for Code Generation","date":"2024-09-20","arxiv_id":"2409.13928","repositories_listed":0,"syntology":null},{"url":null,"slug":"unlocking-memorization-in-large-language","title":"Unlocking Memorization in Large Language Models with Dynamic Soft Prompting","date":"2024-09-20","arxiv_id":"2409.13853","repositories_listed":0,"syntology":null},{"url":null,"slug":"combining-llm-code-generation-with-formal","title":"Combining LLM Code Generation with Formal Specifications and Reactive Program Synthesis","date":"2024-09-18","arxiv_id":"2410.19736","repositories_listed":0,"syntology":null},{"url":null,"slug":"promise-and-peril-of-collaborative-code","title":"Promise and Peril of Collaborative Code Generation Models: Balancing Effectiveness and Memorization","date":"2024-09-18","arxiv_id":"2409.12020","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-no-code-programming-of-cobots","title":"Towards No-Code Programming of Cobots: Experiments with Code Synthesis by Large Code Models for Conversational Programming","date":"2024-09-17","arxiv_id":"2409.11041","repositories_listed":0,"syntology":null},{"url":null,"slug":"rethinkmcts-refining-erroneous-thoughts-in","title":"RethinkMCTS: Refining Erroneous Thoughts in Monte Carlo Tree Search for Code Generation","date":"2024-09-15","arxiv_id":"2409.09584","repositories_listed":0,"syntology":null},{"url":null,"slug":"cpl-critical-planning-step-learning-boosts","title":"CPL: Critical Plan Step Learning Boosts LLM Generalization in Reasoning Tasks","date":"2024-09-13","arxiv_id":"2409.08642","repositories_listed":0,"syntology":null},{"url":null,"slug":"tidal-merza-combining-affective-modelling-and","title":"Tidal MerzA: Combining affective modelling and autonomous code generation through Reinforcement Learning","date":"2024-09-12","arxiv_id":"2409.07918","repositories_listed":0,"syntology":null},{"url":null,"slug":"demo-sgcode-a-flexible-prompt-optimizing","title":"Demo: SGCode: A Flexible Prompt-Optimizing System for Secure Generation of Code","date":"2024-09-11","arxiv_id":"2409.07368","repositories_listed":0,"syntology":null},{"url":"/paper/reranking-laws-for-language-generation-a","slug":"reranking-laws-for-language-generation-a","title":"Reranking Laws for Language Generation: A Communication-Theoretic Perspective","date":"2024-09-11","arxiv_id":"2409.07131","repositories_listed":0,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/reranking-laws-for-language-generation-a#ran","syntology_url":"https://syntology.ai/paper/2409.07131","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2409.07131"}},"official":null}},{"url":null,"slug":"semantic-interoperability-on-blockchain-by","title":"Semantic Interoperability on Blockchain by Generating Smart Contracts Based on Knowledge Graphs","date":"2024-09-11","arxiv_id":"2409.12171","repositories_listed":0,"syntology":null},{"url":null,"slug":"e2llm-encoder-elongated-large-language-models","title":"E2LLM: Encoder Elongated Large Language Models for Long-Context Understanding and Reasoning","date":"2024-09-10","arxiv_id":"2409.06679","repositories_listed":0,"syntology":null},{"url":null,"slug":"differentiable-programming-across-the-pde-and","title":"Differentiable programming across the PDE and Machine Learning barrier","date":"2024-09-09","arxiv_id":"2409.06085","repositories_listed":0,"syntology":null},{"url":null,"slug":"mathbb-uscd-improving-code-generation-of-llms","title":"$\\mathbb{USCD}$: Improving Code Generation of LLMs by Uncertainty-Aware Selective Contrastive Decoding","date":"2024-09-09","arxiv_id":"2409.05923","repositories_listed":0,"syntology":null},{"url":null,"slug":"can-opensource-beat-chatgpt-a-comparative","title":"Can OpenSource beat ChatGPT? -- A Comparative Study of Large Language Models for Text-to-Code Generation","date":"2024-09-06","arxiv_id":"2409.04164","repositories_listed":0,"syntology":null},{"url":null,"slug":"aivril-ai-driven-rtl-generation-with","title":"AIvril: AI-Driven RTL Generation With Verification In-The-Loop","date":"2024-09-03","arxiv_id":"2409.11411","repositories_listed":0,"syntology":null},{"url":null,"slug":"arctic-snowcoder-demystifying-high-quality","title":"Arctic-SnowCoder: Demystifying High-Quality Data in Code Pretraining","date":"2024-09-03","arxiv_id":"2409.02326","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":"benchmarking-llm-code-generation-for-audio","title":"Benchmarking LLM Code Generation for Audio Programming with Visual Dataflow Languages","date":"2024-09-01","arxiv_id":"2409.00856","repositories_listed":0,"syntology":null},{"url":null,"slug":"entropic-distribution-matching-in-supervised","title":"Entropic Distribution Matching in Supervised Fine-tuning of LLMs: Less Overfitting and Better Diversity","date":"2024-08-29","arxiv_id":"2408.16673","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-empirical-study-on-self-correcting-large","title":"An Empirical Study on Self-correcting Large Language Models for Data Science Code Generation","date":"2024-08-28","arxiv_id":"2408.15658","repositories_listed":0,"syntology":null},{"url":null,"slug":"anvil-anomaly-based-vulnerability","title":"ANVIL: Anomaly-based Vulnerability Identification without Labelled Training Data","date":"2024-08-28","arxiv_id":"2408.16028","repositories_listed":0,"syntology":null},{"url":null,"slug":"codesift-an-llm-based-reference-less","title":"CodeSift: An LLM-Based Reference-Less Framework for Automatic Code Validation","date":"2024-08-28","arxiv_id":"2408.15630","repositories_listed":0,"syntology":null},{"url":null,"slug":"retrieval-augmented-instruction-tuning-for-1","title":"Retrieval-Augmented Instruction Tuning for Automated Process Engineering Calculations : A Tool-Chaining Problem-Solving Framework with Attributable Reflection","date":"2024-08-28","arxiv_id":"2408.15866","repositories_listed":0,"syntology":null},{"url":null,"slug":"strategic-optimization-and-challenges-of","title":"Strategic Optimization and Challenges of Large Language Models in Object-Oriented Programming","date":"2024-08-27","arxiv_id":"2408.14834","repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluating-large-language-models-on-spatial","title":"Evaluating Large Language Models on Spatial Tasks: A Multi-Task Benchmarking Study","date":"2024-08-26","arxiv_id":"2408.14438","repositories_listed":0,"syntology":null},{"url":null,"slug":"path-consistency-prefix-enhancement-for","title":"Path-Consistency: Prefix Enhancement for Efficient Inference in LLM","date":"2024-08-25","arxiv_id":"2409.01281","repositories_listed":0,"syntology":null},{"url":null,"slug":"cortexcompile-harnessing-cortical-inspired","title":"CortexCompile: Harnessing Cortical-Inspired Architectures for Enhanced Multi-Agent NLP Code Synthesis","date":"2024-08-23","arxiv_id":"2409.02938","repositories_listed":0,"syntology":null},{"url":null,"slug":"cruxeval-x-a-benchmark-for-multilingual-code","title":"CRUXEval-X: A Benchmark for Multilingual Code Reasoning, Understanding and Execution","date":"2024-08-23","arxiv_id":"2408.13001","repositories_listed":0,"syntology":null},{"url":null,"slug":"domaineval-an-auto-constructed-benchmark-for","title":"DOMAINEVAL: An Auto-Constructed Benchmark for Multi-Domain Code Generation","date":"2024-08-23","arxiv_id":"2408.13204","repositories_listed":0,"syntology":null},{"url":null,"slug":"understanding-defects-in-generated-codes-by","title":"Understanding Defects in Generated Codes by Language Models","date":"2024-08-23","arxiv_id":"2408.13372","repositories_listed":0,"syntology":null},{"url":null,"slug":"autotest-evolutionary-code-solution-selection","title":"AutoTest: Evolutionary Code Solution Selection with Test Cases","date":"2024-08-22","arxiv_id":"2408.12125","repositories_listed":0,"syntology":null},{"url":null,"slug":"automatic-dataset-construction-adc-sample","title":"Automatic Dataset Construction (ADC): Sample Collection, Data Curation, and Beyond","date":"2024-08-21","arxiv_id":"2408.11338","repositories_listed":0,"syntology":null},{"url":null,"slug":"automating-thought-of-search-a-journey","title":"Automating Thought of Search: A Journey Towards Soundness and Completeness","date":"2024-08-21","arxiv_id":"2408.11326","repositories_listed":0,"syntology":null},{"url":null,"slug":"to-code-or-not-to-code-exploring-impact-of","title":"To Code, or Not To Code? Exploring Impact of Code in Pre-training","date":"2024-08-20","arxiv_id":"2408.10914","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-disguised-wolf-is-more-harmful-than-a","title":"A Disguised Wolf Is More Harmful Than a Toothless Tiger: Adaptive Malicious Code Injection Backdoor Attack Leveraging User Behavior as Triggers","date":"2024-08-19","arxiv_id":"2408.10334","repositories_listed":0,"syntology":null},{"url":null,"slug":"bridging-the-language-gap-enhancing","title":"Bridging the Language Gap: Enhancing Multilingual Prompt-Based Code Generation in LLMs via Zero-Shot Cross-Lingual Transfer","date":"2024-08-19","arxiv_id":"2408.09701","repositories_listed":0,"syntology":null},{"url":null,"slug":"plan-with-code-comparing-approaches-for","title":"Plan with Code: Comparing approaches for robust NL to DSL generation","date":"2024-08-15","arxiv_id":"2408.08335","repositories_listed":0,"syntology":null},{"url":null,"slug":"verilogcoder-autonomous-verilog-coding-agents","title":"VerilogCoder: Autonomous Verilog Coding Agents with Graph-based Planning and Abstract Syntax Tree (AST)-based Waveform Tracing Tool","date":"2024-08-15","arxiv_id":"2408.08927","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-system-for-automated-unit-test-generation","title":"A System for Automated Unit Test Generation Using Large Language Models and Assessment of Generated Test Suites","date":"2024-08-14","arxiv_id":"2408.07846","repositories_listed":0,"syntology":null},{"url":null,"slug":"codemirage-hallucinations-in-code-generated","title":"CodeMirage: Hallucinations in Code Generated by Large Language Models","date":"2024-08-14","arxiv_id":"2408.08333","repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluating-language-models-for-efficient-code","title":"Evaluating Language Models for Efficient Code Generation","date":"2024-08-12","arxiv_id":"2408.06450","repositories_listed":0,"syntology":null},{"url":null,"slug":"lut-tensor-core-lookup-table-enables","title":"LUT Tensor Core: A Software-Hardware Co-Design for LUT-Based Low-Bit LLM Inference","date":"2024-08-12","arxiv_id":"2408.06003","repositories_listed":0,"syntology":null},{"url":null,"slug":"top-pass-improve-code-generation-by-pass-k","title":"Top Pass: Improve Code Generation by Pass@k-Maximized Code Ranking","date":"2024-08-11","arxiv_id":"2408.05715","repositories_listed":0,"syntology":null},{"url":null,"slug":"natural-language-outlines-for-code-literate","title":"Natural Language Outlines for Code: Literate Programming in the LLM Era","date":"2024-08-09","arxiv_id":"2408.04820","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-02402","title":"Enhancing AI-based Generation of Software Exploits with Contextual Information","date":"2024-08-05","arxiv_id":"2408.02402","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":"from-llms-to-llm-based-agents-for-software","title":"From LLMs to LLM-based Agents for Software Engineering: A Survey of Current, Challenges and Future","date":"2024-08-05","arxiv_id":"2408.02479","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-new-approach-for-encoding-code-and","title":"A new approach for encoding code and assisting code understanding","date":"2024-08-01","arxiv_id":"2408.00521","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":"pyramid-coder-hierarchical-code-generator-for","title":"Pyramid Coder: Hierarchical Code Generator for Compositional Visual Question Answering","date":"2024-07-30","arxiv_id":"2407.20563","repositories_listed":0,"syntology":null},{"url":null,"slug":"2407-21077","title":"Genetic Instruct: Scaling up Synthetic Generation of Coding Instructions for Large Language Models","date":"2024-07-29","arxiv_id":"2407.21077","repositories_listed":0,"syntology":null},{"url":null,"slug":"generating-unseen-code-tests-in-infinitum","title":"Generating Unseen Code Tests In Infinitum","date":"2024-07-29","arxiv_id":"2407.19772","repositories_listed":0,"syntology":null},{"url":null,"slug":"strong-copyright-protection-for-language","title":"Strong Copyright Protection for Language Models via Adaptive Model Fusion","date":"2024-07-29","arxiv_id":"2407.20105","repositories_listed":0,"syntology":null},{"url":null,"slug":"effective-large-language-model-debugging-with","title":"Effective Large Language Model Debugging with Best-first Tree Search","date":"2024-07-26","arxiv_id":"2407.19055","repositories_listed":0,"syntology":null},{"url":null,"slug":"llasp-fine-tuning-large-language-models-for","title":"LLASP: Fine-tuning Large Language Models for Answer Set Programming","date":"2024-07-26","arxiv_id":"2407.18723","repositories_listed":0,"syntology":null},{"url":null,"slug":"hdl-gpt-high-quality-hdl-is-all-you-need","title":"HDL-GPT: High-Quality HDL is All You Need","date":"2024-07-25","arxiv_id":"2407.18423","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":"splat-a-framework-for-optimised-gpu-code","title":"SPLAT: A framework for optimised GPU code-generation for SParse reguLar ATtention","date":"2024-07-23","arxiv_id":"2407.16847","repositories_listed":0,"syntology":null},{"url":null,"slug":"autovcoder-a-systematic-framework-for","title":"AutoVCoder: A Systematic Framework for Automated Verilog Code Generation using LLMs","date":"2024-07-21","arxiv_id":"2407.18333","repositories_listed":0,"syntology":null},{"url":null,"slug":"compressing-structured-tensor-algebra","title":"Compressing Structured Tensor Algebra","date":"2024-07-18","arxiv_id":"2407.13726","repositories_listed":0,"syntology":null},{"url":null,"slug":"2408-00778","title":"Frontend Diffusion: Exploring Intent-Based User Interfaces through Abstract-to-Detailed Task Transitions","date":"2024-07-16","arxiv_id":"2408.00778","repositories_listed":0,"syntology":null},{"url":null,"slug":"building-ai-agents-for-autonomous-clouds","title":"Building AI Agents for Autonomous Clouds: Challenges and Design Principles","date":"2024-07-16","arxiv_id":"2407.12165","repositories_listed":0,"syntology":null},{"url":null,"slug":"foundational-autoraters-taming-large-language","title":"Foundational Autoraters: Taming Large Language Models for Better Automatic Evaluation","date":"2024-07-15","arxiv_id":"2407.10817","repositories_listed":0,"syntology":null},{"url":null,"slug":"telecomgpt-a-framework-to-build-telecom","title":"TelecomGPT: A Framework to Build Telecom-Specfic Large Language Models","date":"2024-07-12","arxiv_id":"2407.09424","repositories_listed":0,"syntology":null},{"url":null,"slug":"weight-block-sparsity-training-compilation","title":"Weight Block Sparsity: Training, Compilation, and AI Engine Accelerators","date":"2024-07-12","arxiv_id":"2407.09453","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-leakage-of-code-generation-evaluation","title":"On Leakage of Code Generation Evaluation Datasets","date":"2024-07-10","arxiv_id":"2407.07565","repositories_listed":0,"syntology":null},{"url":null,"slug":"funcevalgmn-evaluating-functional-correctness","title":"FuncEvalGMN: Evaluating Functional Correctness of SQL via Graph Matching Network","date":"2024-07-09","arxiv_id":"2407.14530","repositories_listed":0,"syntology":null},{"url":null,"slug":"prompting-techniques-for-secure-code","title":"Prompting Techniques for Secure Code Generation: A Systematic Investigation","date":"2024-07-09","arxiv_id":"2407.07064","repositories_listed":0,"syntology":null},{"url":null,"slug":"what-s-wrong-with-your-code-generated-by","title":"What's Wrong with Your Code Generated by Large Language Models? An Extensive Study","date":"2024-07-08","arxiv_id":"2407.06153","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-computer-programming-education-with","title":"Enhancing Computer Programming Education with LLMs: A Study on Effective Prompt Engineering for Python Code Generation","date":"2024-07-07","arxiv_id":"2407.05437","repositories_listed":0,"syntology":null},{"url":null,"slug":"code-less-align-more-efficient-llm-fine","title":"Code Less, Align More: Efficient LLM Fine-tuning for Code Generation with Data Pruning","date":"2024-07-06","arxiv_id":"2407.05040","repositories_listed":0,"syntology":null},{"url":null,"slug":"automated-c-c-program-repair-for-high-level","title":"Automated C/C++ Program Repair for High-Level Synthesis via Large Language Models","date":"2024-07-04","arxiv_id":"2407.03889","repositories_listed":0,"syntology":null},{"url":null,"slug":"classification-based-automatic-hdl-code","title":"Classification-Based Automatic HDL Code Generation Using LLMs","date":"2024-07-04","arxiv_id":"2407.18326","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-comparative-study-of-dsl-code-generation","title":"A Comparative Study of DSL Code Generation: Fine-Tuning vs. Optimized Retrieval Augmentation","date":"2024-07-03","arxiv_id":"2407.02742","repositories_listed":0,"syntology":null},{"url":"/paper/let-the-code-llm-edit-itself-when-you-edit","slug":"let-the-code-llm-edit-itself-when-you-edit","title":"Let the Code LLM Edit Itself When You Edit the Code","date":"2024-07-03","arxiv_id":"2407.03157","repositories_listed":0,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"5 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; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/let-the-code-llm-edit-itself-when-you-edit#ran","syntology_url":"https://syntology.ai/paper/2407.03157","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.03157"}},"official":null}},{"url":null,"slug":"scaling-data-driven-building-energy-modelling","title":"Scaling Data-Driven Building Energy Modelling using Large Language Models","date":"2024-07-03","arxiv_id":"2407.03469","repositories_listed":0,"syntology":null},{"url":null,"slug":"assessing-the-code-clone-detection-capability","title":"Assessing the Code Clone Detection Capability of Large Language Models","date":"2024-07-02","arxiv_id":"2407.02402","repositories_listed":0,"syntology":null},{"url":null,"slug":"is-your-ai-generated-code-really-secure","title":"Is Your AI-Generated Code Really Safe? Evaluating Large Language Models on Secure Code Generation with CodeSecEval","date":"2024-07-02","arxiv_id":"2407.02395","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-functional-correctness-investigating","title":"Beyond Functional Correctness: Investigating Coding Style Inconsistencies in Large Language Models","date":"2024-06-29","arxiv_id":"2407.00456","repositories_listed":0,"syntology":null},{"url":null,"slug":"brevity-is-the-soul-of-wit-pruning-long-files","title":"Brevity is the soul of wit: Pruning long files for code generation","date":"2024-06-29","arxiv_id":"2407.00434","repositories_listed":0,"syntology":null},{"url":null,"slug":"2407-12022","title":"ITERTL: An Iterative Framework for Fine-tuning LLMs for RTL Code Generation","date":"2024-06-28","arxiv_id":"2407.12022","repositories_listed":0,"syntology":null}],"record_sha256":"aba8c7303134214477025c454943db6cfa15d1bef07a2b60012b4e231ba962c3","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}