2 citations · 2 across the 10 of their papers we have counts for
11 papers
STAB: Specification-driven Testing for Algorithmic Bottlenecks
Soohan Lim, Joonghyuk Hahn, Hyundong Jin +1
Evaluating the efficiency of algorithmic code requires test cases that expose runtime bottlenecks. Previous methods generate efficiency test cases either by increasing input size o…
ECO: Enhanced Code Optimization via Performance-Aware Prompting for Code-LLMs
Su-Hyeon Kim, Joonghyuk Hahn, Sooyoung Cha +1
Code runtime optimization-the task of rewriting a given code to a faster one-remains challenging, as it requires reasoning about performance trade-offs involving algorithmic and st…
RegexPSPACE: A Benchmark for Evaluating LLM Reasoning on PSPACE-complete Regex Problems
Hyundong Jin, Joonghyuk Hahn, Yo-Sub Han
Large language models (LLMs) show strong performance across natural language processing (NLP), mathematical reasoning, and programming, and recent large reasoning models (LRMs) fur…
MECO: Multi-Expert Consensus for Code Time Complexity Prediction
Joonghyuk Hahn, Soohan Lim, Yo-Sub Han
Predicting the complexity of source code is essential for software development and algorithm analysis. Recently, Baik et al. (2025) introduced CodeComplex for code time complexity…
Repairing Regex Vulnerabilities via Localization-Guided Instructions
Sicheol Sung, Joonghyuk Hahn, Yo-Sub Han
Regular expressions (regexes) are foundational to modern computing for critical tasks like input validation and data parsing, yet their ubiquity exposes systems to regular expressi…
ContractEval: A Benchmark for Evaluating Contract-Satisfying Assertions in Code Generation
Soohan Lim, Joonghyuk Hahn, Hyunwoo Park +2
Current code generation evaluation measures functional correctness on well-formed inputs that satisfy all input preconditions. This paradigm has a critical limitation: task descrip…
AmpleHate: Amplifying the Attention for Versatile Implicit Hate Detection
Yejin Lee, Joonghyuk Hahn, Hyeseon Ahn +1
Implicit hate speech detection is challenging due to its subtlety and reliance on contextual interpretation rather than explicit offensive words. Current approaches rely on contras…
TCProF: Time-Complexity Prediction SSL Framework
Joonghyuk Hahn, Hyeseon Ahn, Jungin Kim +2
Time complexity is a theoretic measure to determine the amount of time the algorithm needs for its execution. In reality, developers write algorithms into code snippets within limi…
URECA: The Chain of Two Minimum Set Cover Problems exists behind Adaptation to Shifts in Semantic Code Search
Seok-Ung Choi, Joonghyuk Hahn, Yo-Sub Han
Adaptation is to make model learn the patterns shifted from the training distribution. In general, this adaptation is formulated as the minimum entropy problem. However, the minimu…
CodeComplex: Dataset for Worst-Case Time Complexity Prediction
Seung-Yeop Baik, Joonghyuk Hahn, Jungin Kim +4
Reasoning ability of Large Language Models (LLMs) is a crucial ability, especially in complex decision-making tasks. One significant task to show LLMs' reasoning capability is code…
ATHENA: Mathematical Reasoning with Thought Expansion
JB. Kim, Hazel Kim, Joonghyuk Hahn +1
Solving math word problems depends on how to articulate the problems, the lens through which models view human linguistic expressions. Real-world settings count on such a method ev…