Avancerad sökning

Visar resultat 1 - 5 av 38 avhandlingar som matchar ovanstående sökkriterier.

  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

  2. 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

  3. 3. Harmonic measures

    Författare :Jonatan Vasilis; Göteborgs universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; harmonic measure; square root of the Poisson kernel; Hardy space; p-Laplace operator; random walk; regular tree; discrete minimal thinness; Hardy space;

    Sammanfattning : This thesis uses both analytic and probabilistic methods to study continuous and discrete problems. The main areas of study are the asymptotic properties of p-harmonic measure, and various aspects of the square root of the Poisson kernel. Fix a domain and a boundary point, subject to certain regularity conditions. LÄS MER

  4. 4. Order restricted inference over countable preordered sets. Statistical aspects of neutron detection

    Författare :Vladimir Pastukhov; Matematisk statistik; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Constrained inference; Isotonic regression; Density estimation; Grenander estimator; Limit distribution; Neutron detection;

    Sammanfattning : This thesis consists of four papers. In the first paper, we study the isotonic regression estimator over a general countable preordered set. We obtain the limiting distribution of the estimator and study its properties. Also, it is shown that the isotonisation preserves the rate of convergence of the underlying estimator. LÄS MER

  5. 5. 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