Sökning: "Hardware Compilation"
Visar resultat 1 - 5 av 21 avhandlingar innehållade orden Hardware Compilation.
1. Building Verified Hardware and Verified Stacks in HOL
Sammanfattning : This thesis explores building provably correct software and hardware inside the HOL4 interactive theorem prover. Interactive theorem provers such as HOL4 are proof environments where manual (human) and automated (machine) proofs can be composed in logically safe ways and all proof steps (be it manual or automated) are mechanically checked. LÄS MER
2. Efficient Modelling and Synthesis of Data Intensive Reconfigurable Systems
Sammanfattning : Digital systems are integrated in our environment and have become a natural part of our every day life. As we rely more on these systems our expectations on them increases. We expect them to perform new tasks, communicate and cooperate. The complexity of these systems are increasing. LÄS MER
3. Protecting Functional Programs From Low-Level Attackers
Sammanfattning : Software systems are growing ever larger. Early software systems were singular units developed by small teams of programmers writing in the same programming language. Modern software systems, on the other hand, consist of numerous interoperating components written by different teams and in different programming languages. LÄS MER
4. Hardware/Software Co-Design of Heterogeneous Manycore Architectures
Sammanfattning : In the era of big data, advanced sensing, and artificial intelligence, the required computation power is provided mostly by multicore and manycore architectures. However, the performance demand keeps growing. Thus the computer architectures need to continue evolving and provide higher performance. LÄS MER
5. Building Verified Hardware and Verified Stacks in HOL
Sammanfattning : This thesis explores building provably correct software and hardware inside the HOL4 interactive theorem prover. Interactive theorem provers such as HOL4 are proof environments where manual (human) and automated (machine) proofs can be composed in logically safe ways, and all proof steps (be it manual or automated) are mechanically checked. LÄS MER