Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 27 for “"call graphs"”.

  1. Parallel Paths Analysis Using Function Call Graphs

    Call graphs 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 …

    waterloo Repository record for Parallel Paths Analysis Using Function Call Graphs (opens in a new tab)

  2. Identifying unsoundness of call graphs in android static analysis tools

    … scan applications before deployment. Creating a call graph is a crucial step in many of the static analysis tools for Android applications. Each edge in a call graph is a method call in the application. A sound call graph is one that contains all method calls of an application. The soundness of …

    bu Repository record for Identifying unsoundness of call graphs in android static analysis tools (opens in a new tab)

  3. Where call graphs fall short: Robustness and security-centric study of Android static analysis tools

    Static call graph generation is a foundational step in Android program analysis and underpinsdownstream tasks such as malware analysis, privacy assessment, and digital forensics. However, generating reliable call graphs for modern Android applications remains difficult because Android apps are …

    iastate Repository record for Where call graphs fall short: Robustness and security-centric study of Android static analysis tools (opens in a new tab)

  4. Software Analytics for Improving Program Comprehension

    … to facilitate program comprehensions, such as call graphs, which represent the system’s structure and its implementation as a directed graph. Furthermore, some studies focused on semantic enrichment of the software system problems using systematic learning analytics, including machine learning …

    umkc Repository record for Software Analytics for Improving Program Comprehension (opens in a new tab)

  5. Ranking components of scientific software using spectral methods

    … explore the centrality rankings of functions in call graphs of scientific software using spectral method. Dependency Structure Matrix (DSM) is used as a modeling tool to represent and examine pattern of inter-dependencies among functions. We compute the hubs and authorities in directed networks …

    lethbridge Repository record for Ranking components of scientific software using spectral methods (opens in a new tab)

  6. The Separate Compilation Assumption

    Call graphs are an essential requirement for almost all inter-procedural analyses. This motivated the development of many tools and frameworks to generate the call graph of a given program. However, the majority of these tools focus on generating the call graph of the whole program (i.e., both the …

    waterloo Repository record for The Separate Compilation Assumption (opens in a new tab)

  7. Graph Generalization for Software Engineering

    … algorithms exist for generalizing simple graphs, such as trees, the development of practical methods for applying generalization techniques to more complex graphs remains a critical challenge. In this thesis, we introduce a novel formal model and algorithm, referred to as GGA (Graph …

    calgary Repository record for Graph Generalization for Software Engineering (opens in a new tab)

  8. Efficient and Precise Pointer Analysis for Rust

    … detecting safety issues in Rust due to imprecise call graph and alias/points-to information. Therefore, pointer analysis, a technique for identifying the possible memory locations pointed to by pointers and aiding in the construction of accurate call graph, is urgently needed for improving the …

    unsw Repository record for Efficient and Precise Pointer Analysis for Rust (opens in a new tab)

  9. HCPC: Human centric program comprehension by grouping static execution scenarios

    … code summary of a software system from the call graph is an active research area. A call graph is a visual representation of caller-callee relationships between different methods of a software project. Call graphs can be difficult to comprehend for a larger code-base. The motivation is to …

    sask Repository record for HCPC: Human centric program comprehension by grouping static execution scenarios (opens in a new tab)

  10. Semi-Automatic Software Security Model Extraction: Semi-Automatic Extraction of Security Relevant Information from Source Code for Formally Based Security Models

    … the development of a tool which automatically extracts a formally specified representation of the software architecture with extended security annotations. The extracted architectural model is known as a “SecDFD”, which is a graph-like representation of software architecture populated …

    chalmers Repository record for Semi-Automatic Software Security Model Extraction: Semi-Automatic Extraction of Security Relevant Information from Source Code for Formally Based Security Models (opens in a new tab)

  11. Combining information retrieval modules and structural information for source code bug localization and feature location

    … combines LSI modeling lexical information and call graphs to modeling structural information. The output is a list of methods ranked in descending order by likelihood of requiring modification to correct the bug or implement the feature under consideration. Three case studies including …

    alabama Repository record for Combining information retrieval modules and structural information for source code bug localization and feature location (opens in a new tab)

  12. Storage and processing systems for power-law graphs

    Large graphs abound around us - online social networks, Web graphs, the Internet, citation networks, protein interaction networks, telephone call graphs, peer-to-peer overlay networks, electric power grid networks, etc. Many real- life graphs are power-law graphs. A fundamental challenge in today’s …

    uiuc Repository record for Storage and processing systems for power-law graphs (opens in a new tab)

  13. Identifying Behavioural Implications of Source Code Changes

    … state transition model that captures the flow of call pairs among different partitions based on static and dynamic call graphs. We also extend the approach by incorporating complete dynamic call stacks into the analysis. Finally, we perform a longitudinal analysis of three software systems to …

    waterloo Repository record for Identifying Behavioural Implications of Source Code Changes (opens in a new tab)

  14. Graph-based divide-and-conquer techniques for binary diffing

    … in an extensible binary diffing pipeline. Specifically, we introduce three novel program partitioning techniques; (i) a method combining consensus-based Louvain community detection on programs’ Function Call Graphs (FCGs), followed by further splitting of communities into hash buckets using …

    greece Repository record for Graph-based divide-and-conquer techniques for binary diffing (opens in a new tab)

  15. Countering kernel malware in virtual execution environments

    … on-demand emulation, a technique that dynamically switches a running system between virtualized and emulated execution. Combining the strengths of emulation and virtualization, DARK is able to thoroughly capture the activities of the target module in a guest operating system (OS), while …

    gatech Repository record for Countering kernel malware in virtual execution environments (opens in a new tab)

  16. Cross-language program analysis for dynamic web applications

    … outputs into a compact tree representation (called VarDOM) that represents all possible DOM variants of a web application. Third, we leverage the VarDOM to extract semantic information from the server-side code. Specifically, we develop novel concepts, techniques, and tools (1) to build call …

    iastate Repository record for Cross-language program analysis for dynamic web applications (opens in a new tab)

  17. Test-case-based call graph construction in dynamically typed programming languages

    … source code and its dependencies. However, dynamically typed languages do not define types explicitly in the source code, which difficult source code analysis and therefore the construction of these tools. As an example, the call graph construction, used by IDE’s to build source code navigation …

    brazil-ufrgs Repository record for Test-case-based call graph construction in dynamically typed programming languages (opens in a new tab)

  18. ENHANCING MALWARE DETECTION THROUGH BEHAVIORAL MODELLING AND FEATURE LEARNING

    … approach parses the log of native functions called by a program during its execution. This parsing process enables the creation of Behavior Call Graphs (BCGs) using a novel methodology emphasizing the connections between these native functions. Graph structures offer the ability to …

    houston Repository record for ENHANCING MALWARE DETECTION THROUGH BEHAVIORAL MODELLING AND FEATURE LEARNING (opens in a new tab)

  19. SAF-DL: Semantic Analysis Framework for Deep Learning Open Source Projects

    … projects available on the internet. Specifically, due to the increasing interest of Deep Learning (DL), the number of DL open source projects is also increased. This project is motivated by utilizing the existing projects to develop either a new innovative project or create a better-refined …

    umkc Repository record for SAF-DL: Semantic Analysis Framework for Deep Learning Open Source Projects (opens in a new tab)

Page 1 of 2