2025/12/16 by Liu, Changshu, Ghazanfari, Alireza, Chen, Yang +1
Computer Science · #Automated reasoning #Categorization #Code (set theory) #Construct (python library) #FOS: Computer and information sciences #Generalizability theory #Model-based reasoning #Natural Language Processing Techniques #Pipeline (software) #Python (programming language) #Reasoning system #Software Engineering (cs.SE) #Software Engineering Research #Topic Modeling
paper · doi:10.48550/arxiv.2512.14917
published in Open MIND
openalex publication_date 2025/12/16 · openalex created_date 2025/12/19 · openalex updated_date 2026/07/28
Code reasoning tasks are becoming prevalent in large language model (LLM) assessments. Yet, there is a dearth of studies on the impact of real-world complexities on code reasoning, e.g., inter- or intra-procedural dependencies, API calls, deeply nested constructs, and non-primitive complex types. Evaluating LLMs under such a simplistic setting poses a significant threat to assumptions about their generalizability in practice. To enable a more realistic evaluation of code reasoning, we construct a dataset of 1200 reasoning problems from two sources: existing code reasoning benchmarks and popular GitHub Python repositories. Our pipeline leverages static and dynamic program analysis to automatically serialize/deserialize compound, complex, and custom types galore in real-world code, going far beyond only primitive types used in prior studies. A key feature of our dataset is categorizing each reasoning problem as Lower Complexity (LC) or Higher Complexity (HC) via a principled majority-vote mechanism over nine diverse and interpretable code-complexity metrics, yielding two well-separated, semantically meaningful categories of problem difficulty suitable for precise calibration of LLM reasoning ability. This categorization shows that the problems used in existing code-reasoning evaluation mostly belong to the LC category, failing to represent real-world complexity.