Search for dissertations about: "Datorteknik"

Showing result 6 - 10 of 431 swedish dissertations containing the word Datorteknik.

  2. 6. Code synthesis for timed automata

    Author : Tobias Amnell; Wang Yi; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Computer Systems; Datorteknik;

    Abstract : In this thesis, we study executable behaviours of timed models. The focus is on synthesis of executable code with predictable behaviours from high level abstract models. We assume that a timed system consists of two parts: the control software and the plant (i.e. READ MORE

  4. 7. Efficient symbolic state exploration of timed systems : Theory and implementation

    Author : Johan Bengtsson; Wang Yi; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Computer Systems; Datorteknik;

    Abstract : Timing aspects are important for the correctness of safety-critical systems. It is crucial that these aspects are carefully analysed in designing such systems. UPPAAL is a tool designed to automate the analysis process. READ MORE

  5. 8. Methods for run time analysis of data locality

    Author : Erik Berg; Erik Hagersten; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Computer Systems; Datorteknik;

    Abstract : The growing gap between processor clock speed and DRAM access time puts new demands on software and development tools. Deep memory hierarchies and high cache miss penalties in present and emerging computer systems make execution time sensitive to data locality. READ MORE

  6. 9. Specification and Implementation of Distributed Real-Time Systems for Embedded Applications

    Author : Lars Björnfot; Lars Asplund; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Computer Systems; Datorteknik;

    Abstract : .... READ MORE

  7. 10. Regular Inference for Communication Protocol Entities

    Author : Therese Bohlin; Bengt Jonsson; Dilian Gurov; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Computer engineering; Datorteknik;

    Abstract : A way to create well-functioning computer systems is to automate error detection in the systems. Automated techniques for finding errors, such as testing and formal verification, requires a model of the system. The technique for constructing deterministic finite automata (DFA) models, without access to the source code, is called regular inference. READ MORE