Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Youngseok Choi

dblp:121/9523 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
1since 2021 · last 2025
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Software engineering, systems software and programming languages · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Software testing · 100%

Topics — the 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Software testing
fuzzing
0.912025
ZigZagFuzz: Interleaved Fuzzing of Program Options and Files · ACM Trans. Softw. Eng. Methodol. 2025
Software testing
test coverage
0.312025
ZigZagFuzz: Interleaved Fuzzing of Program Options and Files · ACM Trans. Softw. Eng. Methodol. 2025

Methods — techniques the papers use, named apart from their topics

interleaved mutation · 0.9corpus shrinking · 0.9
YearPublicationVenuePosition
2025 ZigZagFuzz: Interleaved Fuzzing of Program Options and Files
abstract
Command-line options (e.g., -l , -F , -R for ls ) given to a command-line program can significantly alternate the behaviors of the program. Thus, fuzzing not only file input but also program options can improve test coverage and bug detection. In this article, we propose ZigZagFuzz which achieves higher test coverage and detects more bugs than the state-of-the-art fuzzers by separately mutating program options and file inputs in an iterative/interleaving manner. ZigZagFuzz applies the following three core ideas. First, to utilize different characteristics of the program option domain and the file input domain, ZigZagFuzz separates phases of mutating program options from ones of mutating file inputs and performs two distinct mutation strategies on the two different domains. Second, to reach deep segments of a target program that are accessed through an interleaving sequence of program option checks and file inputs checks, ZigZagFuzz continuously interleaves phases of mutating program options with phases of mutating file inputs. Finally, to improve fuzzing performance further, ZigZagFuzz periodically shrinks input corpus by removing similar test inputs based on their function coverage. The experiment results on the 20 real-world programs show that ZigZagFuzz improves test coverage and detects 1.9 to 10.6 times more bugs than the state-of-the-art fuzzers that mutate program options such as AFL++-argv, AFL++-all, Eclipser, CarpetFuzz, ConfigFuzz, and POWER. We have reported the new bugs detected by ZigZagFuzz, and the original developers confirmed our bug reports.
Ahcheong Lee, Youngseok Choi, Shin Hong, Kyutae Cho, Moonzoo Kim
ACM Trans. Softw. Eng. Methodol.2
2016 A Novel Approach to Managing the Dynamic Nature of Semantic Relatedness
abstract
This research proposes a novel method of measuring the dynamics of semantic relatedness. Research on semantic relatedness has a long history in the fields of computational linguistics, psychology, computer science, as well as information systems. Computing semantic relatedness has played a critical role in various situations, such as data integration and keyword recommendation. Many researchers have tried to propose more sophisticated techniques to measure semantic relatedness. However, little research has considered the change of semantic relatedness with the flow of time and occurrence of events. The authors' proposed method is validated by actual corpus data collected from a particular context over a specific period of time. They test the feasibility of our proposed method by constructing semantic networks by using the corpus collected during a different period of time. The experiment results show that our method can detect and manage the changes in semantic relatedness between concepts. Based on the results, the authors discuss the need for a dynamic semantic relatedness paradigm.
Youngseok Choi, Jungsuk Oh, Jinsoo Park 0001
J. Database Manag.1