Essays about: "thesis for programming languages"

Showing result 21 - 25 of 148 essays containing the words thesis for programming languages.

1. 21. Decompilation of WebAssembly using Datalog

   University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

   Author : Love Brandefelt; [2022]
   Keywords : Datalog; Decompiler; WebAssembly; Logic programming; Bytecode; Datalog; Dekompilator; WebAssembly; Logic programming; Bytecode;

   Abstract : With 92% of today’s browsers supporting WebAssembly the need for decompilers to discover malicious code is greater than ever. The introduction of the Datalog to C++ compiler Soufflé, in 2016, enables the implementation of effective Datalog-based decompilers. READ MORE

3. 22. Student Differences in Regards to Programming Experience Beginning Upper Secondary School in Sweden

   University essay from Uppsala universitet/Institutionen för informationsteknologi

   Author : Felix Lager; [2022]
   Keywords : ;

   Abstract : Recent changes in Swedish curriculum now involve programming to be taught in elementary school. There are different programming languages a novice programmer can learn and it can have different effects on the learning ability. READ MORE

4. 23. Performance-Aware Code Size Optimization of Generic Functions through Automatic Implementation of Dynamic Dispatch

   University essay from Linköpings universitet/Programvara och system

   Author : Ivar Härnqvist; [2022]
   Keywords : Compiler technology; Programming language design; Performance; Code size optimization; Generic programming; Polymorphism; Dynamic dispatch; Type erasure; Monomorphization; Templates; C ; Kompilatorteknik; Programspråksdesign; Prestanda; Kodstorleksoptimering; Generisk programmering; Polymorfism; Dynamic dispatch; Typradering; Monomorfisering; Templates; C ;

   Abstract : Monomorphization and dynamic dispatch are two common techniques for implementing polymorphism in statically typed programming languages. Function templates in C++ use the former technique to enable algorithms written as generic functions to be efficiently reused with multiple different data types by producing a separate function instantiation for each invocation that uses a unique permutation of argument types. READ MORE

5. 24. Control Flow Based Static Execution Time Analysis Using Symbolic Execution

   University essay from Luleå tekniska universitet/Institutionen för system- och rymdteknik

   Author : Isak Sundell; [2022]
   Keywords : WCET; symbolic execution; LLVM;

   Abstract : To ensure the correctness of real time systems, it is important to determine the execution time of tasks. The worst case execution time of each task needs to be found in order to determine if the system is schedulable. This thesis aims at bounding the execution time of programs analyzed by KLEE, a symbolic execution engine. READ MORE

6. 25. A JavaScript Backend for the Miking Compiler

   University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

   Author : William Rågstad; [2022]
   Keywords : Bachelor’s Thesis; Miking; JavaScript; Compiler; Semantics; Code Generation; Optimization; Correctness; Soundness; and Readability; Kandidat Examensarbete; Miking; JavaScript; Kompilatorer; Semantik; Kodgenerering; Optimering; Korrekthet; Sundhet och Läsbarhet;

   Abstract : This thesis presents the design and implementation of an extension of the self-hosted Miking compiler to enable the generation of JavaScript code for different runtime environments and web browsers. Miking is a framework for developing domain-specific and general-purpose programming languages through sound language fragment composition, among other things, to create efficient compilers. READ MORE