Search

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

2. 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

3. 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

4. Solving satisfiability of ground term algebras using DPLL and unification

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

6. Verifying a sliding window protocol in mu-CRL

Author

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

Published
2003

15. Generalizing DPLL and satisfiability for equalities

Author

Badban, B. (Bahareh), Pol, J.C. (Jaco) van de, Tveretina, O., Zantema, H. (Hans), Badban, B. (Bahareh), Pol, J.C. (Jaco) van de, Tveretina, O., and Zantema, H. (Hans)

Abstract

We present GDPLL, a generalization of the DPLL procedure. It solves the satisfiability problem for decidable fragments of quantifier-free first-order logic. Sufficient properties are identified for proving soundness, termination and completeness of GDPLL. We show how the original DPLL procedure is an instance. Subsequently the GDPLL instances for equality logic, and the logic of equality over infinite ground term algebras are presented. Based on this, we implemented a decision procedure for abstract datatypes. We provide some benchmarks.

Published
2004

18. Verifying a sliding window protocol in muCRL

Author

Fokkink, W.J. (Wan), Groote, J.F. (Jan Friso), Pang, J., Badban, B. (Bahareh), Pol, J.C. (Jaco) van de, Fokkink, W.J. (Wan), Groote, J.F. (Jan Friso), Pang, J., Badban, B. (Bahareh), and Pol, J.C. (Jaco) van de

Published
2004

19. Verifying a sliding window protocol in mCRL

Author

Fokkink, W.J. (Wan), Groote, J.F. (Jan Friso), Pang, J., Badban, B. (Bahareh), Pol, J.C. (Jaco) van de, Fokkink, W.J. (Wan), Groote, J.F. (Jan Friso), Pang, J., Badban, B. (Bahareh), and Pol, J.C. (Jaco) van de

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.

Published
2003

20. Two solutions to incorporate zero, successor and equality in binary decision diagrams

Author

Badban, B. (Bahareh), Pol, J.C. (Jaco) van de, Badban, B. (Bahareh), and Pol, J.C. (Jaco) van de

Abstract

In this article we extend BDDs (binary decision diagrams) for plain propositional logic to the fragment of first order logic, consisting of quantifier free logic with equality, zero and successor. We insert equations with zero and successor in BDDs, and call these objects (0,S,=)-BDDs. We extend the notion of {em Ordered} BDDs in the presence of equality, zero and successor. (0,S,=)-BDDs can be transformed to equivalent Ordered (0,S,=)-BDD s by applying a number of rewrite rules. All paths in these extended OBDDs are satisfiable. The major advantage of transforming a formula to an equivalent Ordered (0,S,=)-BDD is that on the latter it can be observed in constant time whether the formula is a tautology, a contradiction, or just satisfiable.

Published
2002

Catalog

Books, media, physical & digital resources
See catalog results