Author: "Badban, B." / Topic: theoryofcomputation_mathematicallogicandformallanguages - Searchworks@Jio Institute Digital Library Search Results

Your search keyword '"Badban, B."' showing total 3 results

Start Over Author "Badban, B." Topic theoryofcomputation_mathematicallogicandformallanguages

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

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

Author: Badban, B., Pol, van de, J.C., Tveretina, O., Zantema, H., Kohlhase, M., Design and Analysis of Systems, and Formal System Analysis
Subjects: TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES, Computer Science::Logic in Computer Science, Computer Science::Programming Languages
Abstract: datatypes can be viewed as sorted ground term algebras. Unification can be used to solve conjunctions of equations. We give a new algorithm to extend this to the full quantifier free fragment, i.e. including formulas with disjunction and negation. The algorithm is based on unification (to deal with equality) and DPLL (to deal with propositional logic). In this paper we present our algorithm as an instance of a generalized DPLL algorithm. We prove soundness and completeness of the class of generalized DPLL algorithms, in particular for the algorithm for ground term algebras.
Published: 2004

Books, media, physical & digital resources

Searchworks