Master’s Thesis Presentation • Software Engineering — Parallel Paths Analysis Using Function Call GraphsExport this event to calendar

Friday, September 13, 2019 — 10:00 AM EDT

Arman Naeimian, Master’s candidate
David R. Cheriton School of Computer Science

Function Call Graphs (FCGs) have been used widely in different software engineering areas. Since call graphs provide us with detailed information about the structure of software elements and components and how they are connected with each other, they could be used in detecting specific structures and patterns in the code. Therefore, they are used for the detection of malwares, code clones, plagiarism, unreachable code, and many other software symptoms that could be searched by their structural features. 

In this work, we have analyzed parallel paths in function call graphs in three Java open-source projects and investigated the reasons they are created and used and also the problems that result in removing parallel paths. Moreover, we have used the results of our analyses to find instances of parallel paths in the projects that we analyzed and suggest some changes to developers based on that.

Location 
DC - William G. Davis Computer Research Centre
2564
200 University Avenue West

Waterloo, ON N2L 3G1
Canada

S M T W T F S
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
1
2
3
4
5
  1. 2019 (196)
    1. October (3)
    2. September (20)
    3. August (18)
    4. July (12)
    5. June (23)
    6. May (23)
    7. April (32)
    8. March (25)
    9. February (16)
    10. January (24)
  2. 2018 (220)
    1. December (16)
    2. November (19)
    3. October (26)
    4. September (22)
    5. August (17)
    6. July (20)
    7. June (13)
    8. May (25)
    9. April (34)
    10. March (24)
    11. February (3)
    12. January (1)
  3. 2017 (36)
  4. 2016 (21)
  5. 2015 (36)
  6. 2014 (33)
  7. 2013 (23)
  8. 2012 (4)
  9. 2011 (1)
  10. 2010 (1)
  11. 2009 (1)
  12. 2008 (1)