S. Blom and J. van de Pol. State space reduction by proving confluence. In Computer Aided Verification 2002, number 2404 in LNCS, 2002. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Two Solutions to Incorporate Zero, Successor and Equality in.. - Badban, Pol Self-citation (Pol) (Correct)
....as PVS [19] and SVC [4] In this interactive context, the ability to simplify a formula, without deciding it completely, may be a convenient feature. Finally, the automated theorem prover of the CRL toolset [8, 21] is based on EQ BDD ideas, and applied in the verification of distributed systems [9]. Acknowledgements. We would like to thank Hans Zantema for his helpful idea to use valuations to prove satisfiability and showing us a preliminary version of his paper [29] on termination of term rewriting. 25 ....
S.C.C. Blom and J.C. van de Pol. State space reduction by proving confluence. In E. Brinksma and K.G. Larsen, editors, Proc. of Computer-Aided Verification (CAV), LNCS 2404, pages 596--609. Springer, 2002.
Two Solutions to Incorporate Zero, Successor and Equality in.. - Badban, Pol (2002) Self-citation (Pol) (Correct)
....as PVS [19] and SVC [4] In this interactive context, the ability to simplify a formula, without deciding it completely, may be a convenient feature. Finally, the automated theorem prover of the CRL toolset [8, 21] is based on EQ BDD ideas, and applied in the verification of distributed systems [9]. Acknowledgements. We would like to thank Hans Zantema for his helpful idea to use valuations to prove satisfiability and showing us a preliminary version of his paper [29] on termination of term rewriting. 25 ....
S.C.C. Blom and J.C. van de Pol. State space reduction by proving confluence. In E. Brinksma and K.G. Larsen, editors, Proc. of Computer-Aided Verification (CAV), LNCS 2404, pages 596--609. Springer, 2002.
Calculating τ-Confluence Compositionally - Pace, Lang, Mateescu (2003) (Correct)
No context found.
S. Blom and J. van de Pol. State space reduction by proving confluence. In Computer Aided Verification 2002, number 2404 in LNCS, 2002.
Calculating τ-Confluence Compositionally - Pace, Lang, Mateescu (2003) (Correct)
No context found.
Stefan Blom and Jaco van de Pol. State Space Reduction by Proving Confluence. In Computer Aided Verification 2002.
Analysing the BKE-security protocol with μCRL - Groote, Mauw, Serebrenik (Correct)
No context found.
S.C.C. Blom and J.C. van de Pol, State space reduction by proving confluence. In E. Brinksma and K.G. Larsen, editors, Proceedings of CAV'02, LNCS 2404, Springer Verlag, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC