← Search

Sang-Ki Ko

7 accepted papers

2026

ReSyn: A Generalized Recursive Regular Expression Synthesis Framework

IJCAI 2026

Existing Programming-By-Example (PBE) systems often rely on simplified benchmarks that fail to capture the high structural complexity—such as deeper nesting and frequent Unions—of real-world regexes. To overcome the resulting performance drop, we propose ReSyn, a synthesizer-agnostic divide-and-conq

Cited by 0Scholar
2026

Timestep-Compressed Attack on Spiking Neural Networks Through Timestep-Level Backpropagation

AAAI 2026technical

State-of-the-art (SOTA) gradient-based adversarial attacks on spiking neural networks (SNNs), which largely rely on extending FGSM and PGD frameworks, face a critical limitation: substantial attack latency from multi-timestep processing, rendering them infeasible for practical real-time applications

Cited by 0SourcePDFScholar
2025

CodeComplex: Dataset for Worst-Case Time Complexity Prediction

EMNLP 2025

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 time complexity prediction, which involves variousintricate factors such as the input range of variables and conditional

2025

LogiCase: Effective Test Case Generation from Logical Description in Competitive Programming

IJCAI 2025

Automated Test Case Generation (ATCG) is crucial for evaluating software reliability, particularly in competitive programming where robust algorithm assessments depend on diverse and accurate test cases. However, existing ATCG methods often fail to meet complex specifications or generate effective c

2023

GDA: Grammar-based Data Augmentation for Text Classification using Slot Information

EMNLP 2023long findings

Recent studies propose various data augmentation approaches to resolve the low-resource problem in natural language processing tasks. Data augmentation is a successful solution to this problem and recent strategies give variation on sentence structures to boost performance. However, these approaches…

Cited by 0SourceScholar
2021

MultiFix: Learning to Repair Multiple Errors by Optimal Alignment Learning

EMNLP 2021finding

We consider the problem of learning to repair erroneous C programs by learning optimal alignments with correct programs. Since the previous approaches fix a single error in a line, it is inevitable to iterate the fixing process until no errors remain. In this work, we propose a novel sequence-to-seq…

Cited by 6SourcePDFScholar
2021

SALNet: Semi-supervised Few-Shot Text Classification with Attention-based Lexicon Construction

AAAI 2021technical

We propose a semi-supervised bootstrap learning framework for few-shot text classification. From a small amount of the initial dataset, our framework obtains a larger set of reliable training data by using the attention weights from an LSTM-based trained classifier. We first train an LSTM-based text…

Cited by 26SourcePDFScholar