Search for dissertations about: "tree systems"

Showing result 1 - 5 of 242 swedish dissertations containing the words tree systems.

  2. 1. Lock-free Concurrent Search

    Author : Bapi Chatterjee; Chalmers tekniska högskola; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; Wait-free; Help-aware; Non-blocking; Concurrency; Linearizability; Lock-based; Lock-free-kD-tree; Amortized Complexity; Data Structure; Binary Search Tree; Blocking; Search; Concurrent; kD-tree; Linked-list; Lock-free; Range Search; Language-portable; Help-optimal; Nearest Neighbour Search; Linearizable; Synchronization;

    Abstract : The contemporary computers typically consist of multiple computing cores with high compute power. Such computers make excellent concurrent asynchronous shared memory system. READ MORE

  4. 2. Few is Just Enough! : Small Model Theorem for Parameterized Verification and Shape Analysis

    Author : Frédéric Haziza; Parosh Aziz Abdulla; Tomáš Vojnar; Uppsala universitet; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; program verification; model checking; parameterized systems; infinite-state systems; reachability; approximation; safety; tree systems; shape analysis; small model properties; view abstraction; monotonic abstraction; Computer Science; Datavetenskap;

    Abstract : This doctoral thesis considers the automatic verification of parameterized systems, i.e. systems with an arbitrary number of communicating components, such as mutual exclusion protocols, cache coherence protocols or heap manipulating programs. The components may be organized in various topologies such as words, multisets, rings, or trees. READ MORE

  5. 3. Parameterized Systems : Generalizing and Simplifying Automatic Verification

    Author : Ahmed Rezine; Parosh Aziz Abdulla; Kedar Namjoshi; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Parameterized systems; Automatic verification; Approximation; Regular model checking; Safety; Termination; Computer science; Datavetenskap; Datavetenskap; Computer Science;

    Abstract : In this thesis we propose general and simple methods for automatic verification of parameterized systems. These are systems consisting of an arbitrary number of identical processes or components. The number of processes defines the size of the system. READ MORE

  6. 4. Tree Structures in Broadcast Encryption

    Author : Kristin Anderson; Ingemar Ingemarsson; Jacob Löfvenberg; Robert Forchheimer; Ben Smeets; Linköpings universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Broadcast encryption; Subset Difference; tree structure; Information technology; Informationsteknologi;

    Abstract : The need for broadcast encryption arises when a sender wishes to securely distribute messages to varying subsets of receivers, using a broadcast channel, for instance in a pay-TV scenario. This is done by selecting subsets of users and giving all users in the same subset a common decryption key. READ MORE

  7. 5. Infinite-state Stochastic and Parameterized Systems

    Author : Noomene Ben Henda; Parosh Abdulla; Christel Baier; Uppsala universitet; []
    Keywords : program verification; model checking; stochastic games; infinite-state systems; Markov chains; reachability; repeated reachability; parameterized systems; approximation; safety; tree systems;

    Abstract : A major current challenge consists in extending formal methods in order to handle infinite-state systems. Infiniteness stems from the fact that the system operates on unbounded data structure such as stacks, queues, clocks, integers; as well as parameterization. READ MORE