Search

Your search keyword '"Badban, B."' showing total 2 results
Start Over Author "Badban, B." Topic theoryofcomputation_logicsandmeaningsofprograms
2 results on '"Badban, B."'

1. Verifying a sliding window protocol in µCRL

Author

Fokkink, W.J., Groote, J.F., Pang, J., Badban, B., Pol, van de, J.C., Rattray, C., Maharaj, S., Shankland, C., and Formal System Analysis

Subjects
Model checking, Sequence, Correctness, Computer science, Modulo, Window (computing), Axiomatic system, TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, Computer Science::Logic in Computer Science, Sliding window protocol, Computer Science::Networking and Internet Architecture, Algorithm, Queue
Abstract

We prove the correctness of a sliding window protocol with an arbitrary finite window size n and sequence numbers modulo 2n. We show that the sliding window protocol is branching bisimilar to a queue of capacity 2n. The proof is given entirely on the basis of an axiomatic theory, and was checked with the help of PVS.

Published
2004
Full Text
View/download PDF

2. Verification of a sliding window protocol in µCRL

Author

Badban, B., Fokkink, W.J., Groote, J.F., Pang, J., Pol, van de, J.C., Design and Analysis of Systems, and Formal System Analysis

Subjects
TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS, Computer Science::Logic in Computer Science
Abstract

We prove the correctness of a sliding window protocol with an arbitrary finite window size n and sequence numbers modulo 2n. The correctness consists of showing that the sliding window protocol is branching bisimilar to a queue of capacity 2n. The proof is given entirely on the basis of an axiomatic theory, and has been checked in the theorem prover PVS.

Published
2004

Catalog

Books, media, physical & digital resources
See catalog results