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 26 for “"alias analysis"”.

  1. General Declarative Must-Alias Analysis

    Οι περισσότερες δημοσιευμένες αναλύσεις για δείκτες είναι ίσως-αναλύσεις: δηλαδή υπερεκτιμούν τη σχέση συνωνυμίας δεικτών ή τη σχέση “δείχνει-σε”. Οι αναλύσεις σίγουρης-συνωνυμίας δεικτών έχουν μελετηθεί λιγότερο αλλά προσφέρουν ελκυστικά πλεονεκτήματα, για τη βελτιστοποίηση και την κατανόηση των …

    athens Repository record for General Declarative Must-Alias Analysis (opens in a new tab)

  2. An Empirical Study of Alias Analysis Techniques

    … One such component of software optimization is alias analysis, which attempts to determine which variables in a program refer to the same area in memory, and is used to relocate instructions to improve performance without interfering with program execution. Several alias analyses have been …

    calpoly Repository record for An Empirical Study of Alias Analysis Techniques (opens in a new tab)

  3. On Improving Backwards Reasoning with Symbolic Execution: Integrating Loop Summarization, Alias Analysis, and Compositional Summarization

    Program analysis techniques play a crucial role in modern software development by helping developers find bugs and verify code behavior. These techniques rely heavily on systematic reasoning about program execution paths. Symbolic execution has emerged as a powerful method for systematic program …

    vt Repository record for On Improving Backwards Reasoning with Symbolic Execution: Integrating Loop Summarization, Alias Analysis, and Compositional Summarization (opens in a new tab)

  4. Preserving Structural Alias Information Across the MLIR-to-LLVM Lowering Boundary

    … subviews to pointer arithmetic that LLVM alias analysis cannot distinguish from potentially overlapping accesses. This loss blocks optimizations such as loop-invariant code motion, redundancy elimination, and vectorization, even when accesses are provably disjoint at the MLIR level. This …

    calpoly Repository record for Preserving Structural Alias Information Across the MLIR-to-LLVM Lowering Boundary (opens in a new tab)

  5. Software and architecture support for the bulk multicore

    … and conflict detection hardware to improve alias analysis for general compiler optimizations using speculation. Loop Invariant Code Motion, a widely used traditional compiler pass, is run as an example client pass to test the potential of the new alias analysis.

    uiuc Repository record for Software and architecture support for the bulk multicore (opens in a new tab)

  6. LOW-LEVEL SEMANTICS AND OPTIMIZATIONS

    … rely heavily on precise static analyses, such as alias analysis, to validate semantics-preserving program transformations. However, low-level languages like C and compiler intermediate representations like LLVM IR permit complex memory operations---such as casts between pointers and …

    penn Repository record for LOW-LEVEL SEMANTICS AND OPTIMIZATIONS (opens in a new tab)

  7. Improving Static Analysis for Software Security at Compile-time and Runtime

    … in software development and maintenance. Static analysis approaches can help secure software in different ways. First, it can help identify vulnerabilities ahead-of run. For example, we can search vulnerable code in wild that are similar to buggy code in existing CVE databases, in which the …

    tamu Repository record for Improving Static Analysis for Software Security at Compile-time and Runtime (opens in a new tab)

  8. Interprocedural Data Flow Analysis in a Programming Environment

    … The specific problems discussed are the analysis of aliasing patterns, computation of summary data flow information, and assignment of linkage styles to call sites. A two phase algorithm for alias analysis is developed. Alias introduction analysis, performed during syntax analysis, …

    rice Repository record for Interprocedural Data Flow Analysis in a Programming Environment (opens in a new tab)

  9. Alias-free parameters in C using multibodies

    <p>Aliasing may cause problems for both optimization and reasoning about programs. Since static alias analysis is expensive, and sometimes, even impossible, compilers tend to be conservative. This usually leads to missing some optimization opportunities. Furthermore, when trying to understand code, …

    iastate Repository record for Alias-free parameters in C using multibodies (opens in a new tab)

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

    Pointer analysis determines the potential memory locations a pointer may reference during runtime, serving as a foundational component of static program analysis. This analysis enables numerous applications across software security, program verification, and compiler optimization. Enhancing the …

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

  11. Visible synchronization based cache coherence

    … with user/compiler knowledge (i.e., alias analysis, dependence analysis and user directives) used to eliminate essentially all coherence traffic. To preserve scalability, we aim to use latency tolerance methods like switch-on-every-cycle multithreading, and augment this with simple, …

    concordia Download PDF for Visible synchronization based cache coherence (opens in a new tab)

  12. Generalized full sparse tiling of loop chains

    … by complications such as interprocedural and alias analysis. Placing the dependence analysis burden upon the programmer creates a significant barrier to adoption. In this work, we present a new programming abstraction, the loop chain, that specifies a series of loops and the data they access. …

    colostate Repository record for Generalized full sparse tiling of loop chains (opens in a new tab)

  13. Interprocedural pointer analysis for C

    … operations may access. The key issues of pointer analysis versus alias analysis, modeling of call sites, modeling of the heap, and usage of interprocedural path information are discussed. Solutions given for the first two questions and various solutions for the last two questions were used to …

    rice Repository record for Interprocedural pointer analysis for C (opens in a new tab)

  14. Specifying and verifying program transformations with PTRANS

    … a method of importing external analyses such as alias analysis to overcome potential limitations of temporal logic. Finally, we demonstrate the use of the framework by prototyping, testing, and verifying the correctness of several variants of redundant store elimination in two markedly different …

    uiuc Repository record for Specifying and verifying program transformations with PTRANS (opens in a new tab)

  15. Improving the Efficiency of Graph-Based Static Analysis

    Generally speaking, static program analysis is to figure out whether a program can do whatever the program designers want it to do without actually executing the program. From different perspectives, static analysis studies various properties of a program, including correctness, robustness, …

    uts Repository record for Improving the Efficiency of Graph-Based Static Analysis (opens in a new tab)

  16. LegUp: Open-source High-level Synthesis Research Framework

    … hierarchy using information from compiler alias analysis. We also present a method to efficiently use the block RAMs present in modern FPGAs by grouping memories together. These techniques decrease memory usage and improve performance for our HLS-generated circuits.

    toronto-retro Repository record for LegUp: Open-source High-level Synthesis Research Framework (opens in a new tab)

  17. Memory profiling and management.

    … disambiguation analyses in a compiler, such as alias analysis and dependence analysis, are often limited by the lack of runtime information and conservative nature of compiler analysis. Thus, many optimization opportunities may be lost due to the imprecise or overly conservative analysis result. …

    umn Repository record for Memory profiling and management. (opens in a new tab)

  18. Lightweight Verification via Specialized Typecheckers

    … first contribution is the theory of accumulation analysis, which demonstrates that alias analysis—the key bottleneck in a traditional typestate analysis—is not necessary for 41% of typestate specifications in a literature survey, meaning that those 41% of specifications can be checked using a …

    washington Repository record for Lightweight Verification via Specialized Typecheckers (opens in a new tab)

  19. A Hybrid Software Change Impact Analysis for Large-scale Enterprise Systems

    … to insufficient test coverage. Change Impact Analysis can be used to estimate the impacts of the changes to be applied, providing developers/testers with confidence in selecting necessary tests and identifying untested entities. Conventional change impact analysis approaches include static …

    mcmaster Repository record for A Hybrid Software Change Impact Analysis for Large-scale Enterprise Systems (opens in a new tab)

Page 1 of 2