Prog. Synthesis
Automated programming, code generation, and program induction
20 papers indexed
Decode-Time Grammars: Constrained LLM Generation over a Refinement Order of Grammar Fragments
Shuoming Zhang, Ruiyuan Xu, Haofeng Li, Qiuchu Yu +6 more
This paper introduces decode-time grammars to ensure grammatical and semantic correctness of code generated by large language models, particularly for low-resource programming surfaces.
Combinatorial Synthesis: Scaling Code RLVR via Atomic Decomposition and Recombination
Jiasheng Zheng, Boxi Cao, Boxi Yu, Yuzhong Zhang +5 more
The paper introduces Atomic Decomposition and Recombination (ADR), a novel framework that generates genuinely novel and challenging verifiable code tasks, significantly improving the scalability of Re…
Bridging the Sim-to-Real Gap in Semiconductor Visual Program Synthesis via Input Binarization
Yusuke Ohtsubo, Kota Dohi, Koichiro Yawata, Koki Takeshita +1 more
The paper proposes a visual program synthesis framework using a VLM to generate accurate training data for semiconductor inspection, mitigating the sim-to-real gap by applying input binarization to st…
Weakly Non-Negative Supermartingales for Omega-Regular Verification
The paper introduces lazy Streett supermartingales and their lexicographic extension to certify almost-sure satisfaction of omega-regular properties with polynomial templates under a broad class of sa…
An Empirical Evaluation of LLM-Generated Code Security Across Prompting Methods
The paper empirically evaluates the security quality of LLM-generated code across various prompting methods, finding that while prompting alters the structure of weaknesses, it is insufficient to reli…
GradInf: Gradient Estimation as Probabilistic Inference
Gaurav Arya, Mathieu Huot, Moritz Schauer, Alexander K. Lew +1 more
This paper introduces gradient inference, a new approach to developing sound and efficient gradient estimators for probabilistic programs by reducing gradient estimation to a related probabilistic inf…
Potential Functions as Types
Harrison Grodin, Ethan Chu, Runming Li, Jan Hoffmann +1 more
This paper presents Calf, a dependent type theory for cost verification, which synthesizes the physicist's and banker's views on amortized analysis using potential functions and credit annotations.
False Security Confidence in Benign LLM Code Generation
The paper introduces False Security Confidence (FSC), a new metric to measure the inherent prevalence of security vulnerabilities in code generated by LLMs that are otherwise functionally correct, eve…
ALPS: Automated Least-Privilege Enforcement for Securing Serverless Functions
ALPS is an automated, vendor-agnostic framework that enforces least privilege in serverless functions by analyzing code and generating precise security policies, achieving high coverage and significan…
KBSpec: LLM-driven Formal Specification Generation with Evolving Domain Knowledge Base
Proposed method, KBSpec, uses external and internal knowledge to improve formal specification generation by LLMs, increasing verification pass rates and producing more high-completeness specifications…
AutoACSL: Synthesizing ACSL Specifications by Integrating LLMs with CPG-Based Static Analysis
AutoACSL is a framework that uses Code Property Graphs and large language models to generate formal specifications for C programs with improved success ratio and full proof ratio.
FVSpec: Real-World Property-Based Tests as Lean Challenges
The paper introduces FVSpec, a large-scale benchmark that translates thousands of real-world Python property-based tests into formal Lean 4 specifications to evaluate AI models for formal software ver…
Evolving Features vs Evolving Entire Trees with GP for Interpretable Survival Analysis
This paper proposes using genetic programming (GP) to jointly evolve both the feature sets and the structure of survival trees, resulting in highly interpretable and high-performing shallow models for…
Inferring Code Correctness from Specification
The paper introduces TRAILS~, a novel method that improves code correctness validation by grounding LLM reasoning in concrete (input, output) pairs derived from specifications, achieving state-of-the-…
MOSAIC: Modular Orchestration for Structured Agentic Intelligence and Composition
MOSAIC introduces a structured agentic framework that treats automated data science as a staged, context-grounded model selection problem, improving performance and traceability over traditional AutoM…
Detecting Privilege Escalation in Polyglot Microservices via Agentic Program Analysis
The paper introduces Neo, an agentic program analysis framework that successfully detects zero-day privilege escalation vulnerabilities in complex, polyglot microservices by combining LLMs with advanc…
Performance Analysis in Parallel Programming Education: A Comparative Usability Study
The paper introduces EduMPI, a learning support tool for simplifying cluster usage and performance analysis of MPI parallel programs for students.
VHDLSuite: Unified Pipeline for LLM VHDL Generation with Data Synthesis and Evaluation
Yijun Shen, Minghao Shao, Yichen Zhao, Zhuoyan Yu +3 more
The paper introduces VHDLSuite, an infrastructure for evaluating Large Language Models in VHDL, including a data pipeline, benchmark, and evaluation framework.
KernelScript: Cross-Boundary Typed DSL for eBPF Applications
The paper introduces KernelScript, a DSL for eBPF that types maps, program handles, and execution domains to unify cross-boundary relationships, prevent bugs at compile time, and reduce diff size.
SRTJ: Self-Evolving Rule-Driven Training-Free LLM Jailbreaking
Jindong Li, Ying Liu, Yali Fu, Jinjing Zhu +3 more
The paper proposes SRTJ, a Self-Evolving Rule-Driven Training-Free Jailbreak framework that systematically discovers and refines attack strategies using rule composition and feedback to achieve robust…