Search for dissertations about: "Parameterized systems"
Showing result 1 - 5 of 74 swedish dissertations containing the words Parameterized systems.
-
1. Parameterized Systems : Generalizing and Simplifying Automatic Verification
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
-
2. Few is Just Enough! : Small Model Theorem for Parameterized Verification and Shape Analysis
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
-
3. Infinite-state Stochastic and Parameterized 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
-
4. Verification of Parameterized and Timed Systems : Undecidability Results and Efficient Methods
Abstract : Software is finding its way into an increasing range of devices (phones, medical equipment, cars...). READ MORE
-
5. Model Checking Parameterized Timed Systems
Abstract : In recent years, there has been much advancement in the area of verification of infinite-state systems. A system can have an infinite state-space due to unbounded data structures such as counters, clocks, stacks, queues, etc. It may also be infinite-state due to parameterization, i.e. READ MORE