Sökning: "regular model checking"

Visar resultat 1 - 5 av 9 avhandlingar innehållade orden regular model checking.

  1. 1. Regular Model Checking

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

    Sammanfattning : 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. LÄS MER

  3. 2. Regular model checking

    Författare :Marcus Nilsson; Bengt Jonsson; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer Systems; Datorteknik;

    Sammanfattning : 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. LÄS MER

  4. 3. Verifying Absence of ∞ Loops in Parameterized Protocols

    Författare :Mayank Saksena; Bengt Jonsson; Ahmed Bouajjani; Uppsala universitet; []
    Nyckelord :formal methods; verification; model checking; infinite-state systems; regular model checking; liveness; graph transformation;

    Sammanfattning : The complex behavior of computer systems offers many challenges for formal verification. The analysis quickly becomes difficult as the number of participating processes increases. A parameterized system is a family of systems parameterized on a number n, typically representing the number of participating processes. LÄS MER

  5. 4. New Directions in Symbolic Model Checking

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

    Sammanfattning : 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. LÄS MER

  7. 5. Regular inference for reactive systems

    Författare :Therese Berg; Bengt Jonsson; Joachim Parrow; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Datavetenskap; Computer Science;

    Sammanfattning : Models of reactive systems play a central role in many techniques for verification and analysis of reactive systems. Both a specification of the system and the abstract behavior of the system can be expressed in a formal model. Compliance with the functional parts in the specification can be controlled in different ways. LÄS MER