5 papers
Efficient Regex Matching with Sparse Counting-Sets
Martin Berglund, Brink van der Merwe, Sicheol Sung
Regular expressions with counting operations (c-regexes) offer a compact representation of repeating patterns by allowing numerical bounds to be added to subexpressions. Recent wor…
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…
TRAPDOC: Deceiving LLM Users by Injecting Imperceptible Phantom Tokens into Documents
Hyundong Jin, Sicheol Sung, Shinwoo Park +2
The reasoning, writing, text-editing, and retrieval capabilities of proprietary large language models (LLMs) have advanced rapidly, providing users with an ever-expanding set of fu…
SAGE:Specification-Aware Grammar Extraction for Automated Test Case Generation with LLMs
Aditi, Hyunwoo Park, Sicheol Sung +2
Grammar-based test case generation has proven effective for competitive programming problems, but generating valid and general grammars from natural language specifications remains…
LogiCase: Effective Test Case Generation from Logical Description in Competitive Programming
Sicheol Sung, Aditi, Dogyu kim +2
Automated Test Case Generation (ATCG) is crucial for evaluating software reliability, particularly in competitive programming where robust algorithm assessments depend on diverse a…