The reviewed record of science sign in
Pith

arxiv: 2112.02969 · v1 · pith:HA7RGN4Q · submitted 2021-12-06 · cs.SE · cs.PL

Jigsaw: Large Language Models meet Program Synthesis

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:HA7RGN4Qrecord.jsonopen to challenge →

classification cs.SE cs.PL
keywords languagelargemodelscodejigsawprogramprogrammerimprove
0
0 comments X
read the original abstract

Large pre-trained language models such as GPT-3, Codex, and Google's language model are now capable of generating code from natural language specifications of programmer intent. We view these developments with a mixture of optimism and caution. On the optimistic side, such large language models have the potential to improve productivity by providing an automated AI pair programmer for every programmer in the world. On the cautionary side, since these large language models do not understand program semantics, they offer no guarantees about quality of the suggested code. In this paper, we present an approach to augment these large language models with post-processing steps based on program analysis and synthesis techniques, that understand the syntax and semantics of programs. Further, we show that such techniques can make use of user feedback and improve with usage. We present our experiences from building and evaluating such a tool jigsaw, targeted at synthesizing code for using Python Pandas API using multi-modal inputs. Our experience suggests that as these large language models evolve for synthesizing code from intent, jigsaw has an important role to play in improving the accuracy of the systems.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

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

  1. Agentic generation of verifiable rules for deterministic, self-expanding reaction classification

    cs.AI 2026-07 unverdicted novelty 7.0

    Multi-agent LLMs generate and verify 14,073 deterministic reaction rules from 665,901 patents, enabling 97.7% classification of unseen reactions with finer resolution than fixed proprietary systems.

  2. PlanCompiler: A Deterministic Compilation Architecture for Structured Multi-Step LLM Pipelines

    cs.SE 2026-04 conditional novelty 6.0

    PlanCompiler uses a typed node registry, static validation, and deterministic compilation to reach 278/300 successes on structured LLM pipeline benchmarks, outperforming GPT-4.1 and Claude Sonnet baselines at lower cost.