Searched for: subject%3A%22compilers%22
(1 - 20 of 61)

Pages

document
Reukers, Matthijs (author)
Tydi is an open specification for streaming dataflow designs in digital circuits, allowing designers to express how composite and variable-length data structures are transferred over streams using clear, data-centric types. This provides a higher-level method for defining interfaces between components as opposed to existing bit- and byte-based...
master thesis 2022
document
TIAN, YONGDING (author)
Transferring composite data structures with variable-length fields often requires designing non-trivial protocols that are not compatible between hardware designs. When each project designs its own data format and protocols the ability to collaborate between hardware developers is diminished, which is an issue especially in the open-source...
master thesis 2022
document
Zimmerhackl, Lukas (author)
Dependent programming languages such as Agda show a lot of promise in creating new ways of writing code, but currently suffer from a lack of support and features. In this paper we attempt to create a new back-end for Agda targeting Java which has a huge and thriving ecosystem.<br/><br/>We implement the new back-end for Agda in Haskell and we...
bachelor thesis 2022
document
Meluzzi, Matteo (author)
Dependently typed languages such as Agda have the potential to revolutionize the way we write software because they allow the programmer to catch more bugs at compile time than classical languages. Nonetheless, dependently typed languages are hardly used in practice. One of the reasons is the lack of mature compilers for them.<br/>This paper...
bachelor thesis 2022
document
Kowalewski, Przemysław (author)
STOKE is one of the Superoptimizers which are programs that given a function and a set of instructions of a processor, traverse through a space of programs that compute a given function and try to find the optimal usually in terms of execution speed or size of the binary. Authors of STOKE make some extraordinary claims. They suggest that it is...
bachelor thesis 2022
document
Hartman, Toine (author)
Pattern matching is the act of checking if a value is in the set of values described by a pattern. Many programming languages provide constructs to pattern match on program values. Pattern matching constructs appear in different variants. Stratego, a term rewriting language, features first-class pattern matching, which attempts to match a...
master thesis 2022
document
Krol, A.M. (author), Sarkar, A. (author), Ashraf, I. (author), Al-Ars, Z. (author), Bertels, K.L.M. (author)
Unitary decomposition is a widely used method to map quantum algorithms to an arbitrary set of quantum gates. Efficient implementation of this decomposition allows for the translation of bigger unitary gates into elementary quantum operations, which is key to executing these algorithms on existing quantum computers. The decomposition can be used...
journal article 2022
document
Rocha, Rodrigo C.O. (author), Sprokholt, D.G. (author), Fink, Martin (author), Gouicem, Redha (author), Spink, Tom (author), Chakraborty, S.S. (author), Bhatotia, Pramod (author)
The emergence of new architectures create a recurring challenge to ensure that existing programs still work on them. Manually porting legacy code is often impractical. Static binary translation (SBT) is a process where a program's binary is automatically translated from one architecture to another, while preserving their original semantics....
conference paper 2022
document
Khammassi, N. (author), Ashraf, I. (author), van Someren, J. (author), Nane, R. (author), Krol, A.M. (author), Rol, M.A. (author), Lao, L. (author), Bertels, K.L.M. (author), Almudever, Carmen G. (author)
With the potential of quantum algorithms to solve intractable classical problems, quantum computing is rapidly evolving, and more algorithms are being developed and optimized. Expressing these quantum algorithms using a high-level language and making them executable on a quantum processor while abstracting away hardware details is a...
journal article 2022
document
Chaliasos, Stefanos (author), Sotiropoulos, Thodoris (author), Spinellis, D. (author), Gervais, Arthur (author), Livshits, Benjamin (author), Mitropoulos, Dimitris (author)
We propose a testing framework for validating static typing procedures in compilers. Our core component is a program generator suitably crafted for producing programs that are likely to trigger typing compiler bugs. One of our main contributions is that our program generator gives rise to transformation-based compiler testing for finding...
conference paper 2022
document
Kortbeek, V. (author), Ghosh, Souradip (author), Hester, Josiah (author), Campanoni, Simone (author), Pawełczak, Przemysław (author)
Intermittently operating embedded computing platforms powered by energy harvesting require software frameworks to protect from errors caused by Write After Read (WAR) dependencies. A powerful method of code protection for systems with non-volatile main memory utilizes compiler analysis to insert a checkpoint inside each WAR violation in the...
conference paper 2022
document
Schalkers, M.A. (author), Möller, M. (author)
In this paper we present an approach to find quantum circuits suitable to mimic probabilistic and search operations on a physical NISQ device. We present both a gradient based and a non-gradient based machine learning approach to optimize the created quantum circuits. In our optimization procedure we make use of a cost function that...
conference paper 2022
document
Mrahorović, Mirza (author)
Deep Neural Network (DNNs) have increased significantly in size over the past decade. Partly due to this, the accuracy of DNNs in image classification and speech recognition tasks has increased as well. This enables a great potential for such models to be applied in real-world applications. However, due to their size, the compute and power...
master thesis 2021
document
van der Meer, Tim (author)
The rapid progress quantum devices have made in recent years has led to the need for systems that bridge the gap between quantum algorithms and quantum hardware. To this purpose different full-stack quantum programming platforms have been developed, providing high level languages for expressing quantum algorithms and providing compilers for...
master thesis 2021
document
Bot, Bernard (author)
Compilers translate high-level source code into low-level machine code. To represent source code a compiler uses a language called the intermediate representation (IR). An IR for the compilation of functional languages is continuation-passing style (CPS). It provides convenient abstractions for both data flow and control flow. However, CPS...
master thesis 2021
document
Chaliasos, Stefanos (author), Sotiropoulos, Thodoris (author), Drosos, Georgios Petros (author), Mitropoulos, Charalambos (author), Mitropoulos, Dimitris (author), Spinellis, D. (author)
Despite the substantial progress in compiler testing, research endeavors have mainly focused on detecting compiler crashes and subtle miscompilations caused by bugs in the implementation of compiler optimizations. Surprisingly, this growing body of work neglects other compiler components, most notably the front-end. In statically-typed...
journal article 2021
document
Rouvoet, A.J. (author), Krebbers, R.J. (author), Visser, Eelco (author)
To avoid compilation errors it is desirable to verify that a compiler is type correct-i.e., given well-typed source code, it always outputs well-typed target code. This can be done intrinsically by implementing it as a function in a dependently typed programming language, such as Agda. This function manipulates data types of well-typed source...
journal article 2021
document
Lao, L. (author), van Someren, J. (author), Ashraf, I. (author), Almudever, Carmen G. (author)
Quantum algorithms need to be compiled to respect the constraints imposed by quantum processors, which is known as the mapping problem. The mapping procedure will result in an increase of the number of gates and of the circuit latency, decreasing the algorithm's success rate. It is crucial to minimize mapping overhead, especially for noisy...
journal article 2021
document
van Rijnsoever, Xavier (author)
Software bugs in many different variants can potentially leak sensitive data to an attacker. Implementing a separation mechanism for security domains can prevent incorrect or malicious code to leak sensitive data from one security domain to another. This work presents a separation mechanism based on labeling security domains with a label in...
master thesis 2020
document
Rogers, E.T. (author), Sebus, S.J.G. (author), Polet, W.H. (author), Angelova, Y.Y. (author), van den Akker, Y.A.W. (author)
Raccoon Serious Games develops and hosts educational activities such as escape room events and serious games. They create both physically- and digitally-based escape rooms across many different scales. These events consist of a variety of puzzles and tasks the player(s) have to solve in order to finish or `escape' the event. For their digitally...
bachelor thesis 2020
Searched for: subject%3A%22compilers%22
(1 - 20 of 61)

Pages