2013
DOI: 10.1109/tifs.2012.2223685
|View full text |Cite
|
Sign up to set email alerts
|

Heap Graph Based Software Theft Detection

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
9
0

Year Published

2014
2014
2018
2018

Publication Types

Select...
4
2
2

Relationship

0
8

Authors

Journals

citations
Cited by 30 publications
(9 citation statements)
references
References 9 publications
0
9
0
Order By: Relevance
“…Unlike software watermarks, there is no need for prior information embedding; features unique to the program are taken from the compiled binary and defined as the birthmark. Several different types of birthmark that focus on a different program features have been proposed [3][4][5][6][7][8].…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Unlike software watermarks, there is no need for prior information embedding; features unique to the program are taken from the compiled binary and defined as the birthmark. Several different types of birthmark that focus on a different program features have been proposed [3][4][5][6][7][8].…”
Section: Related Workmentioning
confidence: 99%
“…For example, the Jaccard index [7], Dice's coefficient [4] or cosine similarity [6] are often used for sets, and the longest common subsequence [5,8] is used for sequences. Methods for graphs are more complex; however, methods using graph isomorphism have been proposed [3,9].…”
Section: Related Workmentioning
confidence: 99%
“…Computing the similarity of graphs is relatively more complex. It is conducted by either graph monomorphism [23] or isomorphism algorithms [10], [24], or by translating a graph into a vector using algorithms such as random walk with restart [25].…”
Section: Similarity Calculationmentioning
confidence: 99%
“…Computing the similarity of graphs is relatively more complex. It is conducted by either graph monomorphism or isomorphism algorithms [5,14] or translating a graph into a vector using algorithms such as random walk with restart [4]. In our work, we explore different methods to calculate the similarity of birthmarks generated with the SA and SS model.…”
Section: Similarity Calculationmentioning
confidence: 99%
“…Recently [10,26] suggested to characterize software with core values and applied it to software and algorithm plagiarism detection. A heap graph birthmark based on heap memory analysis is proposed by Patrick et al [5], and graph monomorphism algorithm is used to compute the similarity.…”
Section: Related Workmentioning
confidence: 99%