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 13 of 13 for “"Data Flow Analysis"”.

  1. Path splitting--a technique for improving data flow analysis

    Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1995.

    mit Repository record for Path splitting--a technique for improving data flow analysis (opens in a new tab)

  2. Automatic determination of may/must set usage in data-flow analysis

    Data-flow analysis is a common technique for gathering program information for use in performance improving transformations such as register allocation, deadcode elimination, common subexpression elimination, and scheduling. Current tools for generating data-flow analysis implementations enable …

    colostate Repository record for Automatic determination of may/must set usage in data-flow analysis (opens in a new tab)

  3. Enhancing automated debugging for java programs through data-flow analysis and automated program repair

    Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-10-20 without embargo terms

    uiuc Repository record for Enhancing automated debugging for java programs through data-flow analysis and automated program repair (opens in a new tab)

  4. On Extracting Coarse -Grained Function Parallelism From C Programs

    … built an in-lining based prototype of the memory data-flow analysis system on top of the IMPACT compiler infrastructure. We applied the prototype to analyze the memory data-flow of several MediaBench programs. The experiment results showed that while the prototype performed reasonably well for the …

    uiuc Repository record for On Extracting Coarse -Grained Function Parallelism From C Programs (opens in a new tab)

  5. Constructing Efficient Extensible Compilers With Incremental Analysis

    … (as opposed to the complexity of individual analysis or optimization algorithms) remains a highly complex and less investigated topic. In this dissertation, we present a global approach to extensible and efficient compiler design, which aims at also improving the effectiveness and efficiency …

    uiuc Repository record for Constructing Efficient Extensible Compilers With Incremental Analysis (opens in a new tab)

  6. The validity of a Markov model of the behaviour of programs

    … as optimization by dynamic microprogramming (1], data flow analysis for debugging [21J, and storage allocation in operating systems using paging. For all of these applications, knowledge of the relative frequency of code blocks is not enough, other information must be attached to the states of the …

    vt Repository record for The validity of a Markov model of the behaviour of programs (opens in a new tab)

  7. The lightspeed automatic interactive lighting preview system

    … and corresponding shaders automatically through data-flow analysis and compilation of the original scene. Cache compression reduces automatically-generated deep-framebuffers to reasonable size for complex production scenes and shaders. We also propose a new structure, the indirect framebuffer, …

    mit Repository record for The lightspeed automatic interactive lighting preview system (opens in a new tab)

  8. THAL: An Actor System for Efficient and Scalable Concurrent Computing

    … The THAL compiler incorporates a number of analysis and transformation techniques which work hand in hand with the runtime system. Among the techniques are: global data flow analysis to infer type information--the compiler optimizes code for each message send according to the type of its …

    uiuc Repository record for THAL: An Actor System for Efficient and Scalable Concurrent Computing (opens in a new tab)

  9. The formal relationship between direct and continuation-passing style optimizing compilers: A synthesis of two paradigms

    … representation, code generation, and data flow analysis. For each component, our results pinpoint the superior compilation strategy, the reason for which it dominates the other strategy, and ways to improve the inferior strategy. Furthermore, our work suggests a synthesis of the direct …

    rice Repository record for The formal relationship between direct and continuation-passing style optimizing compilers: A synthesis of two paradigms (opens in a new tab)

  10. Development of a structured method for knowledge elicitation

    … the transference of techniques of systems analysis to the knowledge elicitation process, and in so doing, to develop a structured method for knowledge elicitation. The main contributions to the area of knowledge elicitation made by the research are: i) The development of a method which has …

    greenwich Repository record for Development of a structured method for knowledge elicitation (opens in a new tab)

  11. Algorithms and Frameworks for Accelerating Security Applications on HPC Platforms

    … performance issues, respectively: 1) The flow- and context-sensitive static analysis for the large and complex Android APKs are incredibly time-consuming. Existing CPU-only frameworks/tools have to set a timeout threshold to cease the program analysis to trade the precision for …

    vt Repository record for Algorithms and Frameworks for Accelerating Security Applications on HPC Platforms (opens in a new tab)

  12. Analysis Strategies for Configurable Systems

    … huge number of possible configurations, several analysis approaches (e.g., for verification of configurable systems) implement different strategies to account for configurability. One popular strategy—often applied in practice—is to use sampling (i.e.,analyzing only a subset of all system …

    passau-thes Repository record for Analysis Strategies for Configurable Systems (opens in a new tab)

  13. The tasks with effects model for safe concurrency

    … should offer strong safety guarantees such as data race freedom, atomicity, and optional determinism, while being flexible enough to express the wide range of uses for concurrency in realistic programs, and offering good performance and scalability. In my thesis research, I have defined a new …

    uiuc Repository record for The tasks with effects model for safe concurrency (opens in a new tab)