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

Eryue Zhuang

dblp:157/0513 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2018
—ORCID · none

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

Software engineering, systems software and programming languages · 4Artificial intelligence and machine learning · 1

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
2 papers
Software maintenance and evolution · 50% Program analysis · 50%

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

TopicWeightPapersLastEvidence papers
Program analysis
dynamic analysis
0.522018
Reviving Sequential Program Birthmarking for Multithreaded Software Plagiarism Detection · IEEE Trans. Software Eng. 2018
Software Plagiarism Detection with Birthmarks Based on Dynamic Key Instruction Sequences · IEEE Trans. Software Eng. 2015
Software maintenance and evolution › code clone detection
software plagiarism detection
0.522018
Reviving Sequential Program Birthmarking for Multithreaded Software Plagiarism Detection · IEEE Trans. Software Eng. 2018
Software Plagiarism Detection with Birthmarks Based on Dynamic Key Instruction Sequences · IEEE Trans. Software Eng. 2015

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

thread-oblivious algorithms · 0.3obfuscation resilience analysis · 0.2
YearPublicationVenuePosition
2018 Reviving Sequential Program Birthmarking for Multithreaded Software Plagiarism Detection
abstract
As multithreaded programs become increasingly popular, plagiarism of multithreaded programs starts to plague the software industry. Although there has been tremendous progress on software plagiarism detection technology, existing dynamic birthmark approaches are applicable only to sequential programs, due to the fact that thread scheduling nondeterminism severely perturbs birthmark generation and comparison. We propose a framework called TOB (Thread-oblivious dynamic Birthmark) that revives existing techniques so they can be applied to detect plagiarism of multithreaded programs. This is achieved by thread-oblivious algorithms that shield the influence of thread schedules on executions. We have implemented a set of tools collectively called TOB-PD (TOB based Plagiarism Detection tool) by applying TOB to three existing representative dynamic birthmarks, including SCSSB (System Call Short Sequence Birthmark), DYKIS (DYnamic Key Instruction Sequence birthmark) and JB (an API based birthmark for Java). Our experiments conducted on large number of binary programs show that our approach exhibits strong resilience against state-of-the-art semantics-preserving code obfuscation techniques. Comparisons against the three existing tools SCSSB, DYKIS and JB show that the new framework is effective for plagiarism detection of multithreaded programs. The tools, the benchmarks and the experimental results are all publicly available.
Zhenzhou Tian, Ting Liu 0002, Eryue Zhuang, Ming Fan 0002, Zijiang Yang 0006
IEEE Trans. Software Eng.4
2016 Exploiting thread-related system calls for plagiarism detection of multithreaded programs
Zhenzhou Tian, Ting Liu 0002, Ming Fan 0002, Eryue Zhuang, Zijiang Yang 0006
J. Syst. Softw.5
2015 Software Plagiarism Detection with Birthmarks Based on Dynamic Key Instruction Sequences
abstract
A software birthmark is a unique characteristic of a program. Thus, comparing the birthmarks between the plaintiff and defendant programs provides an effective approach for software plagiarism detection. However, software birthmark generation faces two main challenges: the absence of source code and various code obfuscation techniques that attempt to hide the characteristics of a program. In this paper, we propose a new type of software birthmark called DYnamic Key Instruction Sequence (DYKIS) that can be extracted from an executable without the need for source code. The plagiarism detection algorithm based on our new birthmarks is resilient to both weak obfuscation techniques such as compiler optimizations and strong obfuscation techniques implemented in tools such as SandMark, Allatori and Upx. We have developed a tool called DYKIS-PD (DYKIS Plagiarism Detection tool) and conducted extensive experiments on large number of binary programs. The tool, the benchmarks and the experimental results are all publicly available.
Zhenzhou Tian, Ting Liu 0002, Ming Fan 0002, Eryue Zhuang, Zijiang Yang 0006
IEEE Trans. Software Eng.5
2014 DBPD: A Dynamic Birthmark-based Software Plagiarism Detection Tool
Zhenzhou Tian, Ming Fan 0002, Eryue Zhuang, Haijun Wang 0002, Ting Liu 0002
SEKE4