Sökning: "Model Checking"

Visar resultat 1 - 5 av 133 avhandlingar innehållade orden Model Checking.

  1. 1. Regular Model Checking

    Författare :Marcus Nilsson; Bengt Jonsson; Parosh Aziz Abdulla; Kim Larsen; Uppsala universitet; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; 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

  2. 2. Regular model checking

    Författare :Marcus Nilsson; Bengt Jonsson; Uppsala universitet; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; 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

  3. 3. Model Checking Parameterized Timed Systems

    Författare :Pritha Mahata; Parosh Abdulla; Jean-Francois Raskin; Uppsala universitet; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Model Checking; Parameterized Systems; Undecidability; Timed Petri Nets; Timed Networks; Computer science; Datavetenskap;

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

  4. 4. Effective Techniques for Stateless Model Checking

    Författare :Stavros Aronis; Konstantinos Sagonas; Bengt Jonsson; Patrice Godefroid; Uppsala universitet; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Concurrent; Parallel; Model Checking; Partial Order Reduction; Dynamic Partial Order Reduction; DPOR; Sleep Set Blocking; Source Sets; Source DPOR; Wakeup Trees; Optimal DPOR; Observers; Verification; Bounding; Exploration Tree Bounding; Testing; Erlang; Concuerror; Protocol; Chain Replication; CORFU; Computer Science; Datavetenskap;

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

  5. 5. SAT Based Model Checking

    Författare :Niklas Een; Chalmers University of Technology; []
    Nyckelord :;

    Sammanfattning : This Thesis is a study of automatic reasoning about finite state machines (FSMs). Two techniques used in hardware verification are presented. In both, the verification is carried out by a translation of the problem into propositional logic. Satisfiability and validity of propositional formulas are decided by the use of a SAT solver. LÄS MER