Sökning: "infinite"

Visar resultat 1 - 5 av 417 avhandlingar innehållade ordet infinite.

  1. 1. Games and Probabilistic Infinite-State Systems

    Författare :Sven Sandberg; Parosh Abdulla; Luca de Alfaro; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; program verification; model checking; determinacy; strategy improvement; infinite games; parity games; mean payoff games; stochastic games; Büchi games; reachability games; limiting average; limiting behavior; Markov chains; infinite-state systems; lossy channel systems; vector addition systems; noisy Turing machines; Computer science; Datavetenskap;

    Sammanfattning : Computer programs keep finding their ways into new safety-critical applications, while at the same time growing more complex. This calls for new and better methods to verify the correctness of software. We focus on one approach to verifying systems, namely that of model checking. LÄS MER

  3. 2. Combinatorial Optimization for Infinite Games on Graphs

    Författare :Henrik Björklund; Sergei Vorobyov; Erich Grädel; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; infinite games; combinatorial optimization; randomized algorithms; model checking; strategy evaluation functions; linear programming; iterative improvement; local search; Computer science; Datavetenskap;

    Sammanfattning : Games on graphs have become an indispensable tool in modern computer science. They provide powerful and expressive models for numerous phenomena and are extensively used in computer- aided verification, automata theory, logic, complexity theory, computational biology, etc. LÄS MER

  4. 3. Infinite-state Stochastic and Parameterized Systems

    Författare :Noomene Ben Henda; Parosh Abdulla; Christel Baier; Uppsala universitet; []
    Nyckelord :program verification; model checking; stochastic games; infinite-state systems; Markov chains; reachability; repeated reachability; parameterized systems; approximation; safety; tree systems;

    Sammanfattning : A major current challenge consists in extending formal methods in order to handle infinite-state systems. Infiniteness stems from the fact that the system operates on unbounded data structure such as stacks, queues, clocks, integers; as well as parameterization. LÄS MER

  5. 4. Verification of Infinite-State Systems : Decision Problems and Efficient Algorithms

    Författare :Mats Kindahl; Parosh Aziz Abdulla; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer Systems; Datorteknik;

    Sammanfattning : This thesis presents methods for the verification of distributed systems with infinite state spaces. We consider several verification problems for lossy channel systems, a class of infinite-state systems consisting of finite-state machines that communicate over unbounded, but lossy, FIFO channels. LÄS MER

  7. 5. Precise Reasoning About Non-strict Functional Programs; How to Chase Bottoms, and How to Ignore Them

    Författare :Nils Anders Danielsson; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; partial; inductive; coinductive; non-strict; equational reasoning; lifted; infinite; functional programming;

    Sammanfattning : This thesis consists of two parts. Both concern reasoning about non-strict functional programming languages with partial and infinite values and lifted types, including lifted function spaces.The first part is a case study in program verification: We have written a simple parser and a corresponding pretty-printer in Haskell. LÄS MER