Pith. sign in

REVIEW 2 cited by

Compilable Neural Code Generation with Compiler Feedback

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2203.05132 v1 pith:DRVFYVNR submitted 2022-03-10 cs.CL cs.AIcs.PL

classification cs.CLcs.AIcs.PL
keywords codegenerationcompilabilitycompilablelanguageprogramscodegptcompiler
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Automatically generating compilable programs with (or without) natural language descriptions has always been a touchstone problem for computational linguistics and automated software engineering. Existing deep-learning approaches model code generation as text generation, either constrained by grammar structures in decoder, or driven by pre-trained language models on large-scale code corpus (e.g., CodeGPT, PLBART, and CodeT5). However, few of them account for compilability of the generated programs. To improve compilability of the generated programs, this paper proposes COMPCODER, a three-stage pipeline utilizing compiler feedback for compilable code generation, including language model fine-tuning, compilability reinforcement, and compilability discrimination. Comprehensive experiments on two code generation tasks demonstrate the effectiveness of our proposed approach, improving the success rate of compilation from 44.18 to 89.18 in code completion on average and from 70.3 to 96.2 in text-to-code generation, respectively, when comparing with the state-of-the-art CodeGPT.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Assessing Large Language Models in Comprehending and Verifying Concurrent Programs across Memory Models

    cs.SE 2025-01 conditional novelty 5.0 of 10

    Five LLMs, including GPT-4, handle many simple concurrency checks but cannot reliably verify small programs under TSO and PSO relaxed memory models.

  2. Process-Supervised Reinforcement Learning for Code Generation

    cs.SE 2025-02 conditional novelty 4.0 of 10

    A mutation/refactoring, compile, and execute pipeline auto-generates line-level process supervision that improves reinforcement learning for code generation over outcome-only supervision.

Pith tools