2010 IEEE 34th Annual Computer Software and Applications Conference Workshops 2010
DOI: 10.1109/compsacw.2010.56
|View full text |Cite
|
Sign up to set email alerts
|

Author Identification of Software Source Code with Program Dependence Graphs

Abstract: With the signigicant increase of computer and Internet based crimes, it becomes increasingly important to have techniques that can be applied in a legal setting to assist the court in making judgements about malware, theft of code and computer fraud. To better deal with author identification of software, we propose a semantic approach to identifying authorship through the comparison of program data flows. To do so, we compute program dependences, compute program similarity if detecting theft of code is needed,… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
5
0

Year Published

2012
2012
2024
2024

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(5 citation statements)
references
References 7 publications
0
5
0
Order By: Relevance
“…However, they use semantic information which is not denoted through the grammar of programming languages. So, they typically encode information using graphs, such as program dependence graphs [52,210], control-low graphs [45], and call graphs [187], rather than tokens and trees. Other semantic approaches involve analyzing the similarity of relationships between terms through latent semantic analysis [23,58,237].…”
Section: Functionality (Source Code)mentioning
confidence: 99%
“…However, they use semantic information which is not denoted through the grammar of programming languages. So, they typically encode information using graphs, such as program dependence graphs [52,210], control-low graphs [45], and call graphs [187], rather than tokens and trees. Other semantic approaches involve analyzing the similarity of relationships between terms through latent semantic analysis [23,58,237].…”
Section: Functionality (Source Code)mentioning
confidence: 99%
“…with graph edit distance or sub-graph embedding) to identify indications of plagiarism (e.g. [26,27,28]). While other methods include applying latent semantic analysis to identify similarly referenced terms [29] or identifying similar call graph structures [30].…”
Section: Background a Measuring Program Similaritymentioning
confidence: 99%
“…Like tree-based approaches, graph-based approaches also suffer from high computational complexity in analysing similarity (Baxter et al 1998). Liu et al (2006), and Chen et al (2010) implement such methods by evaluating the similarity of PDGs. These methods are claimed to be immune to plagiarismhiding modifications such as statement reordering, and mapping statements to semantic equivalents.…”
Section: Source Code Plagiarism Detection Toolsmentioning
confidence: 99%