Sökning: "C-compiler"
Visar resultat 1 - 5 av 13 uppsatser innehållade ordet C-compiler.
1. Agda on Raspberry Pi
Master-uppsats, Göteborgs universitet/Institutionen för data- och informationsteknikSammanfattning : This thesis presents an Agda-to-C compiler targeting the Raspberry Pi Pico microcontroller. The compiler implementation includes an unusual choice of run-time algorithm, a Foreign Function Interface generator, and surprisingly little boilerplate code... LÄS MER
2. Compiler Testing by Random Source Code Generation
Master-uppsats, Linköpings universitet/Programvara och systemSammanfattning : Most software projects today are written using programming languages. Compilers in turn translate programs written in these higher level languages into machine code, executable on actual hardware. Ensuring that these compilers function correctly is therefore paramount. LÄS MER
3. Decompilation of WebAssembly using Datalog
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : 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. LÄS MER
4. Improving on C with Rust An analysis of Rusts preventative abilities
Kandidat-uppsats, Uppsala universitet/Institutionen för informationsteknologiSammanfattning : The C programming language is infamous for its ability to be exploited,thus it raises several security concerns. This thesis aims to investigate whether Rust can successfully prevent commonly known C programming errors and if it is a safe choice as a low-level programming language. LÄS MER
5. Graph-based features for machine learning driven code optimization
Master-uppsats, KTH/Skolan för datavetenskap och kommunikation (CSC)Sammanfattning : In this paper we present a method of using the Shortest-Path Graph Kernel, on graph-based features of computer programs, to train a Support Vector Regression model which predicts execution time speedup over baseline given an unseen program and a point in optimization space, based on a method proposed in Using Graph-Based Program Characterization for Predictive Modeling by Park et al. The optimization space is represented by command-line parameters to the polyhedral C-to-C compiler PoCC, and PolyBench is used to generate the data set of speedups over baseline. LÄS MER