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 35 for “"control flow graphs"”.

  1. Visualizing Control Flow Graphs

    Control Flow Graphs (CFGs) are directed graphs that represent all possible paths a computer program can take during its execution. They are used to analyze computer programs for purposes such as compilation, performance, and security. Experts in these areas visualize the contents of CFGs alongside …

    arizona-thes Repository record for Visualizing Control Flow Graphs (opens in a new tab)

  2. Graph-theoretic Properties of Control Flow Graphs and Applications

    … with determining appropriate width parameters of control flow graphs so that certain computationally hard problems of practical interest become efficiently solvable. A well-known result of Thorup states that the treewidth of control flow graphs arising from structured (goto-free) programs is at …

    waterloo Repository record for Graph-theoretic Properties of Control Flow Graphs and Applications (opens in a new tab)

  3. Source-code Summarization of Java Methods Using Control-Flow Graphs

    … explored the use of a sequence extracted from control-flow graph that shows a contextual relationship between program instructions based on control-flow relationships for source-code summarization models. In this work, we employ control-flow graph representations to increase the prediction …

    sask Repository record for Source-code Summarization of Java Methods Using Control-Flow Graphs (opens in a new tab)

  4. The construction and applications of callback control flow graphs for event-driven and framework-based mobile apps

    … apps. In Android, we observe that the changes of control flow between entry points are mostly handled by the framework using callbacks. These callbacks can be executed synchronously and asynchronously when an external event happens (e.g. a click event) or a framework call is made. In …

    iastate Repository record for The construction and applications of callback control flow graphs for event-driven and framework-based mobile apps (opens in a new tab)

  5. Communicating software design patterns with InfoMaps

    … InfoRun system, which simulates the execution of Control Flow Graphs presented in the InfoMap notation. Contains a case study on software design patterns.

    concordia Download PDF for Communicating software design patterns with InfoMaps (opens in a new tab)

  6. From Value-Flow Graphs to Flow-Sensitive Constraint Graphs: Sparse Pointer Analysis

    … the quality of downstream static analysis tasks. Flow-sensitive pointer analysis constitutes an essential component of precise program analysis for accurately modeling pointer behaviors by incorporating control flows. Flow-sensitive pointer analysis is extensively used in alias analysis, taint …

    unsw Repository record for From Value-Flow Graphs to Flow-Sensitive Constraint Graphs: Sparse Pointer Analysis (opens in a new tab)

  7. Effective And Efficient Preemption Placement For Cache Overhead Minimization In Hard Real-Time Systems

    … place preemption points supporting linear control flow graphs (CFGs) for limited preemption scheduling applications. We extend the derivation of loaded cache blocks (LCB), that was proposed for linear control flow graphs (CFGs) to conditional CFGs. We show how to integrate our revised LCB …

    wayne-thes Repository record for Effective And Efficient Preemption Placement For Cache Overhead Minimization In Hard Real-Time Systems (opens in a new tab)

  8. Compile-Time Analysis of Explicitly Parallel Programs

    … The problem stems from the inadequacy of control flow graphs to describe information flows in a parallel program, and the insufficiency of data dependences and control dependences to describe the constraints for a correct execution. Because of the difficulties in analyzing explicitly …

    uiuc Repository record for Compile-Time Analysis of Explicitly Parallel Programs (opens in a new tab)

  9. Declarative Specification of Intraprocedural Control-flow and Dataflow Analysis

    … code. The use of declarative paradigms in dataflow analysis as part of static program analysis has become increasingly popular in recent years. This is due to its enhanced expressivity and modularity, allowing for a higher-level programming approach, resulting in easy and efficient …

    lund Repository record for Declarative Specification of Intraprocedural Control-flow and Dataflow Analysis (opens in a new tab) Download PDF for Declarative Specification of Intraprocedural Control-flow and Dataflow Analysis (opens in a new tab)

  10. Graph Embeddings for the extraction of Compiler Provenance features

    … Our approach applies embedding algorithms to the control flow graphs of binaries. In this document, we explore two graph embedding methods: tiered approaches and alternative embedding representations for analysis. Our results indicate that our method has the potential for use in compiler …

    umn Repository record for Graph Embeddings for the extraction of Compiler Provenance features (opens in a new tab)

  11. Adaptive predication via compiler-microarchitecture cooperation

    … prediction. The first mechanism is a set of new control flow instructions, called wish branches. With wish branches, the compiler generates code that can be executed either as normal branch code or as predicated code. At run-time, the hardware chooses between normal branch code and predicated …

    texas Repository record for Adaptive predication via compiler-microarchitecture cooperation (opens in a new tab)

  12. Reverse Engineering of Binary Programs using Graph Attention Networks

    … Attention Neural Networks (GNNs) based on their Control-Flow Graphs (CFGs). Given a binary program, BinGAT extracts its CFG through static analysis and transforms the assembly instructions within each basic block into embeddings, preserving contextual information. By leveraging graph attention …

    kennesaw Repository record for Reverse Engineering of Binary Programs using Graph Attention Networks (opens in a new tab)

  13. OppropBERT: An Extensible Graph Neural Network and BERT-style Reinforcement Learning-based Type Inference System

    … takes as an input the raw code along with its Control Flow Graphs to predict the error heatmap or the type annotation. The pre-trained BERT-style Transformer model helps encode the code tokens without specifying the programming language's grammar including the type rules. Moreover, using a …

    waterloo Repository record for OppropBERT: An Extensible Graph Neural Network and BERT-style Reinforcement Learning-based Type Inference System (opens in a new tab)

  14. Trust, transforms, and control flow: A graph-theoretic method to verifying source and binary control flow equivalence

    … or invalidate that trust by comparing the control flow graphs (CFGs) for a piece of source code to the corresponding CFG for the disassembled binary. This is done by putting the source CFG through a series of program functionality preserving transforms that implement different control …

    iastate Repository record for Trust, transforms, and control flow: A graph-theoretic method to verifying source and binary control flow equivalence (opens in a new tab)

  15. Automatic parallelization of Prolog programs

    … It begins by describing the construction of control flow graphs and shows how to identify recursive procedures that can be converted to loops. Lastly, dependence analysis methods and several source-to-source transformations from Fortran are used to synchronize and parallelize these loops. The …

    uiuc Repository record for Automatic parallelization of Prolog programs (opens in a new tab)

  16. Formalizing the SSA-based Compiler for Verified Advanced Program Transformations

    … memory safety, dynamic semantics, and control-flow-graphs. Based on the tools and metatheory, the dissertation implements verified and extractable applications for LLVM that include an interpreter for the LLVM IR, a transformation for enforcing memory safety, translation validators for …

    penn Repository record for Formalizing the SSA-based Compiler for Verified Advanced Program Transformations (opens in a new tab)

  17. Compilation and Binary Editing for Performance and Security

    … mechanism generates data representing control flow graphs of each function. These data allow binary analysis tools to identify the boundaries of basic blocks and the types of edges between them without examining individual instructions. A similar compilation mechanism is used to create …

    maryland Repository record for Compilation and Binary Editing for Performance and Security (opens in a new tab)

  18. Increasing Branch Coverage with Dual Metric RTL Test Generation

    … With the help of extracted Data Dependency and Control Flow Graphs, in every <golden, mutation> pair, branches containing variables dependent on the mutated statement are instrumented to track them. The first stage uses Evolutionary algorithms with Ant Colony Optimization to generate test …

    vt Repository record for Increasing Branch Coverage with Dual Metric RTL Test Generation (opens in a new tab)

  19. RALLY: Retargetable Assembly Lifter to LLVM IR

    … code (PIC) semantics, and produce unsound control-flow graphs. In this paper, we present RALLY, a retargetable lifter that translates symbolized x86-64 NASM assembly into LLVM IR. By consuming symbolized assembly, such as the output of formally verified decompilation tools, RALLY …

    vt Repository record for RALLY: Retargetable Assembly Lifter to LLVM IR (opens in a new tab)

Page 1 of 2