Search

Your search keyword '"Pol, J.C. (Jaco) van de"' showing total 209 results
Start Over Author "Pol, J.C. (Jaco) van de"
209 results on '"Pol, J.C. (Jaco) van de"'

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

103. Modal abstractions in $ \mu $ CRL

Author

Pol, J.C. (Jaco) van de, Valero Espada, M.A. (Miguel), Pol, J.C. (Jaco) van de, and Valero Espada, M.A. (Miguel)

Abstract

We describe a framework to generate modal abstract approximations from process algebraic specifications, written in the language µ-CRL. We introduce a new format for processes specification called Modal Linear Process Equation (MLPE). An MLPE represents all the possible interleavings of the parallel composition of a number of processes. Every transition step may lead to a set of abstract states labelled with a set of abstract actions. We use MLPEs to characterize abstract interpretations of systems and to generate Modal Labelled Transition Systems, in which transitions may have two modalities may and must. We prove that the abstractions are sound for the full action-based µ-calculus. The main parts of the theory have been formalized and proved using the automatic theorem prover PVS. The set of definitions, theorems and proofs composes a reusable framework to formally analyze process specifications.

Published
2004

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

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

112. Modal abstractions in $ \mu $ CRL

Author

Pol, J.C. (Jaco) van de, Valero Espada, M.A. (Miguel), Pol, J.C. (Jaco) van de, and Valero Espada, M.A. (Miguel)

Abstract

We describe a framework to generate modal abstract approximations from process algebraic specifications, written in the language µ-CRL. We introduce a new format for processes specification called Modal Linear Process Equation (MLPE). An MLPE represents all the possible interleavings of the parallel composition of a number of processes. Every transition step may lead to a set of abstract states labelled with a set of abstract actions. We use MLPEs to characterize abstract interpretations of systems and to generate Modal Labelled Transition Systems, in which transitions may have two modalities may and must. We prove that the abstractions are sound for the full action-based µ-calculus. The main parts of the theory have been formalized and proved using the automatic theorem prover PVS. The set of definitions, theorems and proofs composes a reusable framework to formally analyze process specifications.

Published
2004

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

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

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

125. New developments around the mCRL tool set

Author

Blom, S.C.C. (Stefan), Groote, J.F. (Jan Friso), Langevelde, I.A. van, Lisser, B. (Bert), Pol, J.C. (Jaco) van de, Blom, S.C.C. (Stefan), Groote, J.F. (Jan Friso), Langevelde, I.A. van, Lisser, B. (Bert), and Pol, J.C. (Jaco) van de

Published
2003

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

131. New developments around the mCRL tool set

Author

Blom, S.C.C. (Stefan), Groote, J.F. (Jan Friso), Langevelde, I.A. van, Lisser, B. (Bert), Pol, J.C. (Jaco) van de, Blom, S.C.C. (Stefan), Groote, J.F. (Jan Friso), Langevelde, I.A. van, Lisser, B. (Bert), and Pol, J.C. (Jaco) van de

Published
2003

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

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