Search for dissertations about: "infinite-state systems"

Showing result 11 - 15 of 16 swedish dissertations containing the words infinite-state systems.

  2. 11. Automatic Verification of Parameterized Systems by Over-Approximation

    Author : Vladislavs Jahundovics; Ulf Nilsson; Cristina Seceleanu; Linköpings universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES;

    Abstract : This thesis presents a completely automatic verification framework to check safety properties of parameterized systems. A parameterized system is a family of finite state systems where every system consists of a finite number of processes running in parallel the same algorithm. READ MORE

  4. 12. Regular model checking

    Author : Marcus Nilsson; Bengt Jonsson; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Computer Systems; Datorteknik;

    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

  5. 13. New Directions in Symbolic Model Checking

    Author : Julien d'Orso; Parosh Abulla; Yassine Lakhnech; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Informatics; computer and systems science; Informatik; data- och systemvetenskap; Informatics; computer and systems science; Informatik; data- och systemvetenskap;

    Abstract : In today's computer engineering, requirements for generally high reliability have pushed the notion of testing to its limits. Many disciplines are moving, or have already moved, to more formal methods to ensure correctness. This is done by comparing the behavior of the system as it is implemented against a set of requirements. READ MORE

  6. 14. Compact Constraints for Verification of Well Quasi-Ordered Programs

    Author : Aletta Nylén; Parosh Abdulla; Kaisa Sere; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Computer science; Datavetenskap;

    Abstract : In this thesis we present algorithms and constraint systems for efficient verification of infinite-state transition systems that are monotonic with respect to a well quasi-ordering. A major problem in verification of infinite-state systems is constraint explosion, that is, the number of constraints generated during analysis is too large. READ MORE

  7. 15. Regular Model Checking

    Author : Marcus Nilsson; Bengt Jonsson; Parosh Aziz Abdulla; Kim Larsen; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; formal methods; model checking; verification; regular sets; Computer science; Datavetenskap;

    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