Sökning: "mayank saksena"
Hittade 1 avhandling innehållade orden mayank saksena.
1. Verifying Absence of ∞ Loops in Parameterized Protocols
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
Resultatsidor:
1