41 citations · 51 across the 8 of their papers we have counts for
10 papers
On the Succinctness of Good-for-MDPs Automata
Sven Schewe, Qiyi Tang
Good-for-MDPs and good-for-games automata are two recent classes of nondeterministic automata that reside between general nondeterministic and deterministic automata. Deterministic…
A novel family of finite automata for recognizing and learning -regular languages
Yong Li, Sven Schewe, Qiyi Tang
Families of DFAs (FDFAs) have recently been introduced as a new representation of -regular languages. They target ultimately periodic words, with acceptors revolving around acce…
Comparing One with Many -- Solving Binary2source Function Matching Under Function Inlining
Ang Jia, Ming Fan, Xi Xu +6
Binary2source function matching is a fundamental task for many security applications, including Software Component Analysis (SCA). The "1-to-1" mechanism has been applied in existi…
Unleashing the Power of Compiler Intermediate Representation to Enhance Neural Program Embeddings
Zongjie Li, Pingchuan Ma, Huaijin Wang +4
Neural program embeddings have demonstrated considerable promise in a range of program analysis tasks, including clone identification, program repair, code completion, and program…
On Good-for-MDPs Automata
Sven Schewe, Qiyi Tang, Tansholpan Zhanabekova
Nondeterministic good-for-MDPs (GFM) automata are for MDP model checking and reinforcement learning what good-for-games (GFG) automata are for reactive synthesis: a more compact al…
1-to-1 or 1-to-n? Investigating the effect of function inlining on binary similarity analysis
Ang Jia, Ming Fan, Wuxia Jin +6
Binary similarity analysis is critical to many code-reuse-related issues and "1-to-1" mechanism is widely applied, where one function in a binary file is matched against one functi…
Approximate Bisimulation Minimisation
Stefan Kiefer, Qiyi Tang
We propose polynomial-time algorithms to minimise labelled Markov chains whose transition probabilities are not known exactly, have been perturbed, or can only be obtained by sampl…
Comparing Labelled Markov Decision Processes
Stefan Kiefer, Qiyi Tang
A labelled Markov decision process is a labelled Markov chain with nondeterminism, i.e., together with a strategy a labelled MDP induces a labelled Markov chain. The model is relat…
Computing Probabilistic Bisimilarity Distances for Probabilistic Automata
Giorgio Bacci, Giovanni Bacci, Kim G. Larsen +3
The probabilistic bisimilarity distance of Deng et al. has been proposed as a robust quantitative generalization of Segala and Lynch's probabilistic bisimilarity for probabilistic…
A Systematic Impact Study for Fuzzer-Found Compiler Bugs
Michaël Marcozzi, Qiyi Tang, Alastair F. Donaldson +1
Despite much recent interest in compiler randomized testing (fuzzing), the practical impact of fuzzer-found compiler bugs on real-world applications has barely been assessed. We pr…