Sökning: "tree systems"
Visar resultat 1 - 5 av 245 avhandlingar innehållade orden tree systems.
1. Lock-free Concurrent Search
Sammanfattning : The contemporary computers typically consist of multiple computing cores with high compute power. Such computers make excellent concurrent asynchronous shared memory system. LÄS MER
2. Few is Just Enough! : Small Model Theorem for Parameterized Verification and Shape Analysis
Sammanfattning : 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. LÄS MER
3. Parameterized Systems : Generalizing and Simplifying Automatic Verification
Sammanfattning : 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. LÄS MER
4. Tree Structures in Broadcast Encryption
Sammanfattning : 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. LÄS MER
5. Infinite-state Stochastic and Parameterized Systems
Sammanfattning : 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. LÄS MER