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 6 of 6 for “"Dependence Graphs"”.

  1. Cloneless: Code Clone Detection via Program Dependence Graphs with Relaxed Constraints

    … a method of detecting clones using a program dependence graph and subgraph isomorphism to identify similar subgraphs, ultimately illuminating clones. The project imposes few constraints when comparing code segments to potentially reveal more clones.</p>

    calpoly Repository record for Cloneless: Code Clone Detection via Program Dependence Graphs with Relaxed Constraints (opens in a new tab)

  2. Processor parallelism considerations and memory latency reduction in shared memory multiprocessors

    … the maximum speedup for a loop with a cyclic dependence graph is limited by its critical dependence ratio, independent of the number of iterations in the loop. The fine-grained processors are better suited for executing these loops with cyclic dependence graphs, while the multiprocessor has …

    uiuc Repository record for Processor parallelism considerations and memory latency reduction in shared memory multiprocessors (opens in a new tab)

  3. Advanced Slicing of Sequential and Concurrent Programs

    … data structures used for slicing are program dependence graphs. They can also be used for different purposes: A new approach to clone detection based on identifying similar subgraphs in program dependence graphs is presented; it is able to detect modified clones better than other tools. In the …

    passau-thes Repository record for Advanced Slicing of Sequential and Concurrent Programs (opens in a new tab)

  4. Access and information flow control to secure mobile web service compositions in resource constrained environments

    … by making use of the concept of program dependence graphs (PDGs). Program dependence graphs use path conditions as necessary conditions for secure information flow control. The advantage of this approach to securing information sharing is that, information is only propagated if the …

    cape-town Repository record for Access and information flow control to secure mobile web service compositions in resource constrained environments (opens in a new tab)

  5. The exploitation of pipeline parallelism by compile time dataflow analysis

    … of resource conflicts is accomplished with data dependence analysis, while the elimination of resource conflicts is accomplished by instruction stream code transformation. The transformation of instruction streams is guided by data dependence analysis, and dependence graphs. This thesis is based …

    unlv Repository record for The exploitation of pipeline parallelism by compile time dataflow analysis (opens in a new tab)

  6. A Sparse Program Dependence Graph For Object Oriented Programming Languages

    The Program Dependence Graph (PDG) has achieved widespread acceptance as a useful tool for software engineering, program analysis, and automated compiler optimizations. This thesis presents the Sparse Object Oriented Program Dependence Graph (SOOPDG), a formalism that contains elements of …

    ucf