Search for dissertations about: "Mayank Saksena"
Found 1 swedish dissertation containing the words Mayank Saksena.
-
1. Verifying Absence of ∞ Loops in Parameterized Protocols
Abstract : 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. READ MORE
Result pages:
1