Sökning: "Computer Science with specialization in Embedded Systems"

Visar resultat 6 - 9 av 9 avhandlingar innehållade orden Computer Science with specialization in Embedded Systems.

1. 6. Models and Complexity Results in Real-Time Scheduling Theory

   Författare :Pontus Ekberg; Wang Yi; Alberto Marchetti-Spaccamela; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Real-time systems; Scheduling theory; Task models; Computational complexity; Datavetenskap med inriktning mot inbyggda system; Computer Science with specialization in Embedded Systems;

   Sammanfattning : When designing real-time systems, we want to prove that they will satisfy given timing constraints at run time. The main objective of real-time scheduling theory is to analyze properties of mathematical models that capture the temporal behaviors of such systems. LÄS MER

3. 7. New techniques for handling quantifiers in Boolean and first-order logic

   Författare :Peter Backeman; Philipp Rümmer; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Datavetenskap med inriktning mot inbyggda system; Computer Science with specialization in Embedded Systems;

   Sammanfattning : The automation of reasoning has been an aim of research for a long time. Already in 17th century, the famous mathematician Leibniz invented a mechanical calculator capable of performing all four basic arithmetic operators. LÄS MER

4. 8. Quantifiers and Theories : A Lazy Approach

   Författare :Peter Backeman; Philipp Rümmer; Jie-Hong Roland Jiang; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Automated Reasoning; Automated Theorem Proving; SMT; Unification; Datavetenskap med inriktning mot inbyggda system; Computer Science with specialization in Embedded Systems;

   Sammanfattning : In this thesis we study Automated Theorem Proving (ATP) as well as Satisfiability Modulo Theories (SMT) and present lazy strategies for improving reasoning within these areas. A lazy strategy works by simplifying a problem, and gradually refines the abstraction only when necessary. LÄS MER

5. 9. Approximations and abstractions for reasoning about machine arithmetic

   Författare :Aleksandar Zeljic; Philipp Rümmer; Uppsala universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Datavetenskap med inriktning mot inbyggda system; Computer Science with specialization in Embedded Systems;

   Sammanfattning : Safety-critical systems rely on various forms of machine arithmetic to perform their tasks: integer arithmetic, fixed-point arithmetic or floating-point arithmetic. The problem with machine arithmetic is that it can exhibit subtle differences in behavior compared to the ideal mathematical arithmetic, due to fixed-size representation in memory. LÄS MER