Sökning: "LLVM"

Hittade 3 avhandlingar innehållade ordet LLVM.

  1. 1. Artificial Software Diversification for WebAssembly

    Författare :Javier Cabrera Arteaga; Benoit Baudry; Martin Monperrus; Tobias Wrigstad; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; WebAssembly; LLVM; Software Diversity; Automatic Software Engineering; Security; Electrical Engineering; Elektro- och systemteknik;

    Sammanfattning : WebAssembly has become the fourth official web language, along with HTML, CSS and JavaScript since 2019. WebAssembly allows web browsers to execute existing programs or libraries written in other languages, such as C/C++ and Rust. In addition, WebAssembly evolves to be part of edge-cloud computing platforms. LÄS MER

  3. 2. Constraint-Based Register Allocation and Instruction Scheduling

    Författare :Roberto Castañeda Lozano; Christian Schulte; Ingo Sander; Mats Carlsson; Laurent Michel; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; constraint programming; combinatorial optimization; register allocation; instruction scheduling; compiler construction; Informations- och kommunikationsteknik; Information and Communication Technology;

    Sammanfattning : Register allocation (mapping variables to processor registers or memory) and instruction scheduling (reordering instructions to improve latency or throughput) are central compiler problems. This dissertation proposes a combinatorial optimization approach to these problems that delivers optimal solutions according to a model, captures trade-offs between conflicting decisions, accommodates processor-specific features, and handles different optimization criteria. LÄS MER

  4. 3. Integrated Register Allocation and Instruction Scheduling with Constraint Programming

    Författare :Roberto Castañeda Lozano; Christian Schulte; Mats Carlsson; Ingo Sander; Peter van Beek; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Computer Science; Datalogi;

    Sammanfattning : This dissertation proposes a combinatorial model, program representations, and constraint solving techniques for integrated register allocation and instruction scheduling in compiler back-ends. In contrast to traditional compilers based on heuristics, the proposed approach generates potentially optimal code by considering all trade-offs between interdependent decisions as a single optimization problem. LÄS MER