Sökning: "Parosh Abdulla"

Visar resultat 1 - 5 av 19 avhandlingar innehållade orden Parosh Abdulla.

  1. 1. Decision problems in systolic circuit verification

    Författare :Parosh Abdulla; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : .... LÄS MER

  3. 2. State space representation for verification of open systems

    Författare :Irem Aktug; Mads Dam; Parosh Abdulla; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer science; Datalogi;

    Sammanfattning : When designing an open system, there might be no implementation available for cer- tain components at verification time. For such systems, verification has to be based on assumptions on the underspecified components. In this thesis, we present a framework for the verification of open systems through explicit state space representation. 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. On Solving String Constraints

    Författare :Phi Diep Bui; Mohamed Faouzi Atig; Parosh Abdulla; Matthew Hague; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; String constraint solving; SMT; Verification;

    Sammanfattning : Software systems are deeply involved in diverse human activities as everyone uses a variety of software systems on a daily basis. It is essential to guarantee that software systems all work correctly. Two popular methods for finding failures of software systems are testing and model checking. LÄS MER

  7. 5. Verification of Parameterized and Timed Systems : Undecidability Results and Efficient Methods

    Författare :Johann Deneux; Parosh Abdulla; Eugene Asarin; Uppsala universitet; []
    Nyckelord :Parameterized Systems; Timed Systems; Symbolic Model Checking; Forward Reachability; Acceleration; Robust Languages; Language Universality; Automata Minimization; Bisimulation;

    Sammanfattning : Software is finding its way into an increasing range of devices (phones, medical equipment, cars...). LÄS MER