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 788 for “"Compilers"”.

  1. Fuzzing OpenMP Compilers

    … correctness significant. Unfortunately, OpenMP compilers are not tested as thoroughly as regular C/C++ compilers. More importantly, it is difficult to apply previous mutation-based testing techniques like EMI because of the parallelism in seed programs. This thesis introduces new fuzz testing …

    waterloo Repository record for Fuzzing OpenMP Compilers (opens in a new tab)

  2. Aspect structure of compilers

    Compilers are among the most widely-studied pieces of software; and, modularizing these valuable artifacts is a recurring theme in research. However, modularization of cross-cutting concerns in compilers is not yet well explored. Even today, implementation of one compiler concern scatters across …

    sask Repository record for Aspect structure of compilers (opens in a new tab)

  3. Compilers for Secure Computation

    … forbidding programming models. We argue that compilers are necessary to democratize secure computation: a compiler would allow developers can write applications without worrying about the complicated details of using cryptographic mechanisms such as MPC and HE. To this end, we present two …

    cornell Repository record for Compilers for Secure Computation (opens in a new tab)

  4. Matrix-based restructuring compilers

    Thesis (Ph. D.)--Michigan State University. Department of Computer Science, 1999

    msu Repository record for Matrix-based restructuring compilers (opens in a new tab)

  5. Symbolic analysis for parallelizing compilers

    The notion of dependence captures the most important properties of a program for efficient execution on parallel computers. The dependence structure of a program defines the necessary constraints of the order of execution of the program components, and provides sufficient information for the …

    uiuc Repository record for Symbolic analysis for parallelizing compilers (opens in a new tab)

  6. Evaluating Speedup in Parallel Compilers

    … toward parallel programming. However, modern compilers are still largely single threaded and do not take advantage of the machine resources available to them. There has been a lot of work done on compilers that add parallel constructs to the programs they are compiling, enabling programs to …

    unf Repository record for Evaluating Speedup in Parallel Compilers (opens in a new tab) Download PDF for Evaluating Speedup in Parallel Compilers (opens in a new tab)

  7. Language extension via dynamically extensible compilers.

    … focuses on a complementary solution: plug-in compilers. In this approach languages are extended at run-time via dynamic extensions to compilers, called plug-ins. Plug-ins can be used to extend the expressiveness, safety and efficiency of languages. However, a plug-in compiler provides other …

    unsw Repository record for Language extension via dynamically extensible compilers. (opens in a new tab)

  8. A New Look at Retargetable Compilers

    … tools, as well as some existing retargetable compilers, in an attempt to determine how those errors occurred and how a system like Hy-C could assist in reducing future software errors. In the end, the potential for a simple retargetable solution like Hy-C is shown to be very simple, yet …

    unt Repository record for A New Look at Retargetable Compilers (opens in a new tab)

  9. Modular Compilers and Their Correctness Proofs

    … the construction and correctness of modular compilers. Modular compilation is a compiler construction technique allowing the construction of compilers for high-level programming languages from reusable compiler building blocks. Modular compilers are defined in terms of denotational semantics …

    uiuc Repository record for Modular Compilers and Their Correctness Proofs (opens in a new tab)

  10. Syntax-Directed Error Recovery for Compilers

    Made available in DSpace on 2014-12-10T20:13:29Z (GMT). No. of bitstreams: 1 7206983.pdf: 5968265 bytes, checksum: 167b685834782c50adcab40596de9e1d (MD5) Previous issue date: 1971

    uiuc Repository record for Syntax-Directed Error Recovery for Compilers (opens in a new tab)

  11. Editing Compilers, Their Feasibility and Effects

    Made available in DSpace on 2014-12-08T22:24:03Z (GMT). No. of bitstreams: 1 6706625.pdf: 3423355 bytes, checksum: 98f09f461666f666ace4fcad10841817 (MD5) Previous issue date: 1966

    uiuc Repository record for Editing Compilers, Their Feasibility and Effects (opens in a new tab)

  12. Multilingual Fault Localization for Deep Learning Compilers

    Deep learning compilers play an increasingly important role in implementing learned algorithms efficiently. These compilers are commonly implemented using a set of different programming languages: languages suitable for manipulating high-level tensor graph representations differ from those used to …

    carleton Repository record for Multilingual Fault Localization for Deep Learning Compilers (opens in a new tab)

  13. Composable Compilers: Evolution toward a Practical Reality

    … small language extensions in traditional compilers remain a challenge. General-purpose programming languages do not have desired mechanisms to integrate small, independently developed extensions into a working programming language. At the same time, domain-specific languages that support …

    cornell Repository record for Composable Compilers: Evolution toward a Practical Reality (opens in a new tab)

  14. Constructing Efficient Extensible Compilers With Incremental Analysis

    Much of the research in compiler design and optimization has traditionally focused on the effectiveness and efficiency of code optimization. However, the subject of efficiency of the entire compilation process itself (as opposed to the complexity of individual analysis or optimization algorithms) …

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

  15. Type-Safe Tree Transformations for Precisely-Typed Compilers

    Compilers translate programs from a source language to a target language. This can be done by translating into an intermediate tree representation, performing multiple partial transformations on the tree, and translating out. Compiler implementers must choose between encoding transformation …

    waterloo Repository record for Type-Safe Tree Transformations for Precisely-Typed Compilers (opens in a new tab)

  16. A Global Approach to Detection of Parallelism (Compilers)

    Modern computers will increasingly rely on parallelism to achieve high computation rates. Techniques to automatically detect and exploit parallelism have been shown effective for computers with vector capabilities. To employ similar techniques for asynchronous multiprocessor machines, the analysis …

    rice Repository record for A Global Approach to Detection of Parallelism (Compilers) (opens in a new tab)

  17. A Study of Typing­Related Bugs in JVM compilers

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

    athens Repository record for A Study of Typing­Related Bugs in JVM compilers (opens in a new tab)

Page 1 of 40