paper-with-me

Papers

Static Program Analysis Guided LLM Based Unit Test Generation

2025-03-07 · Sujoy Roychowdhury, Giriprasad Sridhara, A K Raghavan, Joy Bose, Sourav Mazumdar, Hamender Singh, Srinivasan Bajji Sugumaran, Ricardo Britto

We describe a novel approach to automating unit test generation for Java methods using large language models (LLMs). Existing LLM-based approaches rely on sample usage(s) of the method to test (focal method) and/or provide the entire class of the focal method as input prompt and context. The former approach is often not viable due to the lack of sample usages, especially for newly written focal methods. The latter approach does not scale well enough; the bigger the complexity of the focal method and larger associated class, the harder it is to produce adequate test code (due to factors such as exceeding the prompt and context lengths of the underlying LLM). We show that augmenting prompts with \emph{concise} and \emph{precise} context information obtained by program analysis %of the focal method increases the effectiveness of generating unit test code through LLMs. We validate our approach on a large commercial Java project and a popular open-source Java project.

📄 PDF Abstract BibTeX arXiv:2503.05394

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

LSPRAG: LSP-Guided RAG for Language-Agnostic Real-Time Unit Test Generation

2025-10-25 · Gwihwan Go, Quan Zhang, Chijin Zhou, Zhao Wei 외 arxiv

Automated unit test generation is essential for robust software development, yet existing approaches struggle to generalize across multiple programming languages and operate within real-time development. While Large Lang…

Transforming Probabilistic Programs for Model Checking

2020-08-21 · Ryan Bernstein, Matthijs Vákár, Jeannette Wing

Probabilistic programming is perfectly suited to reliable and transparent data science, as it allows the user to specify their models in a high-level language without worrying about the complexities of how to fit the mod…

modelProbabilistic Programming

Synthesizing Imperative Programs from Examples Guided by Static Analysis

2017-02-21 · Sunbeom So, Hakjoo Oh

We present a novel algorithm that synthesizes imperative programs for introductory programming courses. Given a set of input-output examples and a partial program, our algorithm generates a complete program that is consi…

Program Synthesis

Hybrid Fuzzing with LLM-Guided Input Mutation and Semantic Feedback

2025-11-06 · Shiyin Lin arxiv

Software fuzzing has become a cornerstone in automated vulnerability discovery, yet existing mutation strategies often lack semantic awareness, leading to redundant test cases and slow exploration of deep program states.…

Semantic Similarity

SwiftSolve: A Self-Iterative, Complexity-Aware Multi-Agent Framework for Competitive Programming

2025-10-26 · Adhyayan Veer Singh, Aaron Shen, Brian Law, Ahmed Ismail 외 arxiv

Correctness alone is insufficient: LLM-generated programs frequently satisfy unit tests while violating contest time or memory budgets. We present SwiftSolve, a complexity-aware multi-agent system for competitive program…