Search for dissertations about: "thesis checking"
Showing result 1 - 5 of 229 swedish dissertations containing the words thesis checking.
-
1. Regular Model Checking
Abstract : A major current challenge in the area of program verification is to extend its applicability to infinite-state systems. A system can be infinite-state because it operates on unbounded data structures, such as queues, stacks, integers, etc., or because its description is parameterized by the number of components inside the system. READ MORE
-
2. Regular model checking
Abstract : We present regular model checking, a framework for algorithmic verification of infinite-state systems with, e.g., queues, stacks, integers, or a parameterized linear topology. States are represented by strings over a finite alphabet and the transition relation by a regular length-preserving relation on strings. READ MORE
-
3. 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
-
4. Towards Pattern Based Architectural Conformance Checking
Abstract : Patterns are a source of knowledge when architecting software systems. They provide abstract and time-tested solutions that show how a system should be structured to achieve needed qualities. However, when developing software there is a chance that small mistakes are introduced in the source code. READ MORE
-
5. Effective Techniques for Stateless Model Checking
Abstract : Stateless model checking is a technique for testing and verifying concurrent programs, based on exploring the different ways in which operations executed by the processes of a concurrent program can be scheduled. The goal of the technique is to expose all behaviours that can be a result of scheduling non-determinism. READ MORE