Searcharxiv⌕ Search

arXiv subjects

Shin Hong

Publications and source records attributed to Shin Hong.

4 recordsLinked to original sources

Cluster-theoretic Newton--Okounkov polytopes of flag varieties of types $A_4$ and $B_2$

Newton--Okounkov bodies have been used for studying toric degenerations of flag varieties. We classify the Newton--Okounkov polytopes associated with cluster valuations and the anticanonical line bundle on full flag varieties of types $A_4$ and $B_2$. In type $A_4$, the $672$ seeds of cluster type $D_6$ yield $162$ affine unimodular equivalence classes, which coincide with the combinatorial equivalence classes. We determine the subgroup of exchange-graph automorphisms preserving every polytope class. It is a Klein four group of index six in the automorphism group of the exchange graph of cluster type $D_6$. In type $B_2$, we give defining inequalities for all six seeds. At the anticanonical weight, the two combinatorial equivalence classes split into three affine unimodular equivalence classes. Their respective class-preserving automorphism groups have orders four and two.

math.CO↗

Refining LLM-based Directed Test Input Generation via Runtime Value Feedback

Despite their remarkable capabilities, LLM-based directed input generation produces off-target test inputs when their underlying hypotheses on the target program's behaviors are incorrect. To effectively ground LLM-based directed input generation in actual program behaviors, we propose ReDig, a runtime feedback-guided framework for iterative refinement of LLM-based directed input generation. When a generated input fails to reach a given target code location, ReDig conducts a postmodern analysis to identify incorrect hypotheses by comparing expected runtime values and their actual runtime values observed in the off-target test execution. ReDig utilizes the postmortem analysis result as feedback to refine the inference context, guiding the subsequent test generations toward the target location. In this paper, we present our work-in-progress on ReDig. We illustrate how runtime feedback-guided refinement operates through four case studies with two real-world C/C++ programs (Poppler and Libsndfile). Furthermore, we report preliminary experiment results that show ReDig successfully generates crash-reproducing inputs for 24 out of the 59 CVEs collected from Sec-Bench.

cs.SE↗

Refining Fuzzed Crashing Inputs for Better Fault Diagnosis

We present DiffMin, a technique that refines a fuzzed crashing input to gain greater similarities to given passing inputs to help developers analyze the crashing input to identify the failure-inducing condition and locate buggy code for debugging. DiffMin iteratively applies edit actions to transform a fuzzed input while preserving the crash behavior. Our pilot study with the Magma benchmark demonstrates that DiffMin effectively minimizes the differences between crashing and passing inputs while enhancing the accuracy of spectrum-based fault localization, highlighting its potential as a valuable pre-debugging step after greybox fuzzing.

cs.SE↗

Predictive Mutation Analysis via Natural Language Channel in Source Code

Mutation analysis can provide valuable insights into both System Under Test (SUT) and its test suite. However, it is not scalable due to the cost of building and testing a large number of mutants. Predictive Mutation Testing (PMT) has been proposed to reduce the cost of mutation testing, but it can only provide statistical inference about whether a mutant will be killed or not by the entire test suite. We propose Seshat, a Predictive Mutation Analysis (PMA) technique that can accurately predict the entire kill matrix, not just the mutation score of the given test suite. Seshat exploits the natural language channel in code, and learns the relationship between the syntactic and semantic concepts of each test case and the mutants it can kill, from a given kill matrix. The learnt model can later be used to predict the kill matrices for subsequent versions of the program, even after both the source and test code have changed significantly. Empirical evaluation using the programs in the Defects4J shows that Seshat can predict kill matrices with the average F-score of 0.83 for versions that are up to years apart. This is an improvement of F-score by 0.14 and 0.45 point over the state-of-the-art predictive mutation testing technique, and a simple coverage based heuristic, respectively. Seshat also performs as well as PMT for the prediction of mutation scores only. Once Seshat trains its model using a concrete mutation analysis, the subsequent predictions made by Seshat are on average 39 times faster than actual test-based analysis.

cs.SE↗