Sökning: "Mayank Saksena"

Hittade 1 avhandling innehållade orden Mayank Saksena.

  1. 1. Verifying Absence of ∞ Loops in Parameterized Protocols

    Detta är en avhandling från Uppsala : Acta Universitatis Upsaliensis

    Författare :Mayank Saksena; Uppsala universitet.; Uppsala universitet.; [2008]
    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