Jan Frisco Groote, Francois Monin, and Jan van de Pol. Checking Verifications of protocols and Distributed Systems by Computer. In David Sangiorgi and Robert de Simone, editors, CONCUR'98, volume 1466 of Lecture Notes in Computer Science, pages 629--655. SpringerVerlag, 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....data objects. These proof obligations can be derived by means of algebraic calculations, in general with the help of invariants (i.e. properties of the reachable states) that are proved separately. This method was used in the verification of a considerable number of real life protocols (e.g. [FGK97, GMP98, SvdZ98]) often with the support of a theorem prover or proof checker. The main idea of this method is that quite often in the implementation of a system, internal actions progress inertly towards a state in which no internal actions can be executed; such a state is declared to be a focus point. The ....

J.F. Groote, F. Monin, and J.C. van de Pol. Checking verifications of protocols and distributed systems by computer. In D. Sangiorgi and R. de Simone, editors, Proceedings of 9th Conference on Concurrency Theory, volume 1466 of Lecture Notes in Computer Science, pages 629--655. Springer-Verlag, 1998.

....The proof technique is completely in terms of these functions. This way, one can prove branching bisimilarity without generating the associated transition systems. This technique, referred to as the cones and foci proof technique, has been applied successfully in numerous case studies; see e.g. [7, 10, 14, 21]. We give the adaptation of the cones and foci technique for timed branching bisimilarity. The definition of timed branching bisimilarity can di#er substantially depending on the assumptions made in modeling timed behavior. In timed CRL, one of the most prominent assumptions is left open: the time ....

J. F. Groote, F. Monin, and J. C. van de Pol. Checking verifications of protocols and distributed systems by computer. In D. Sangiorgi and R. de Simone, editors, Proceedings of CONCUR'98, volume 1466 of Lecture Notes in Computer Science, pages 629--655. Springer-Verlag, 1998.

....based on Martin Lof s type theory. The correctness proof of the algorithm is outlined and the difficulties are discussed. 1 Introduction Considerable work has been done on checking verifications of distributed systems by using general proof checkers, e.g. Coq, HOL, Isabelle, Lego etc. see [3] for a survey of the work. In any proof checker it is a hard work to verify a distributed algorithm because of the inherent complexity of distributed algorithm. In this paper we will implement a distributed algorithm for the dining philosophers problem from [1] in the proof checker Agda [2] Agda ....

J. F. Groote, F. Monin, and J. van de Pol. Checking verifications of protocols and distributed systems by computer. In CONCUR: 9th International Conference on Concurrency Theory. LNCS, Springer-Verlag, 1998.

No context found.

J.F. Groote, F. Monin, and J. van de Pol. Checking verifications of protocols and distributed systems by computer. In D. Sangiorgi and R. de Simone, editors, Proceedings CONCUR'98, volume 1466 of Lecture Notes in Computer Science, pages 629--655. Sophia Antipolis, Springer-Verlag, 1998.

....the use of invariants [3] and state mappings [16] Also the confluence property of an LPO can be expressed as a large first order formula [15] Using these techniques, large distributed systems were verified in a precise and logical way, often with the help of interactive theorem provers. See [9] for an overview of such case studies. Since the confluence properties and the correctness criteria associated with state mappings for industrial scale case studies tend to be rather flat but very large, we are developing a specialised theorem prover based on an extension of BDDs with equality ....

J.F. Groote, F. Monin, and J.C. van de Pol. Checking verifications of protocols and distributed systems by computer. In Proc. 9th Conference on Concurrency Theory, LNCS 1466, pp. 629--655. Springer, 1998.

....have been extended with data ( 17, 12] The most expressive [10] and by far the most developed is CRL [12] being the process algebra ACP extended with equational abstract datatypes. The process algebra CRL is the basis of several novel proof methodologies [14, 13] and numerous verifications (see [11]) which for a large part have been computer checked. Also, it has been the basis for several fundamental studies about for instance expressiveness and decidability [10] and visualisation of huge state spaces [27] Finally, a toolset around CRL has been constructed which is not based on finite ....

Groote, J., Monin, F., and van de Pol, J. Checking verifications of protocols and distributed systems by computer. In Proceedings CONCUR'98 (1998), D. Sangiorgi and R. de Simone, Eds., vol. 1466 of Lecture Notes in Computer Science, Sophia Antipolis, Springer-Verlag, pp. 629--655.

.... verifications of protocols and distributed systems by computer Extended version of a tutorial at CONCUR 98 [32] Jan Friso Groote 1;2 Fran cois Monin 2 Jaco van de Pol 2 1: CWI, P.O. Box 94079, 1090 GB Amsterdam, The Netherlands. 2: Department of Mathematics and Computing Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands. E mail: JanFriso.Groote cwi.nl ....

J.F. Groote, F. Monin and J.C. van de Pol. Checking verifications of protocols and distributed systems by computer. In D. Sangiorgi and R. de Simone, Proceedings of Concur'98, Sophia Antipolis, LNCS 1466, pages 629--655, Springer-Verlag, 1998.

No context found.

Jan Frisco Groote, Francois Monin, and Jan van de Pol. Checking Verifications of protocols and Distributed Systems by Computer. In David Sangiorgi and Robert de Simone, editors, CONCUR'98, volume 1466 of Lecture Notes in Computer Science, pages 629--655. SpringerVerlag, 1998.

No context found.

Jan Frisco Groote, Francois Monin, and Jan van de Pol. Checking Verifications of protocols and Distributed Systems by Computer. In David Sangiorgi and Robert de Simone, editors, CONCUR'98, volume 1466 of Lecture Notes in Computer Science, pages 629--655. Springer-Verlag, 1998.

No context found.

Jan Frisco Groote, Francois Monin, and Jan van de Pol. Checking Verifications of protocols and Distributed Systems by Computer. In David Sangiorgi and Robert de Simone, editors, CONCUR'98, volume 1466 of Lecture Notes in Computer Science, pages 629--655. SpringerVerlag, 1998.

No context found.

Jan Frisco Groote, Francois Monin, and Jan van de Pol. Checking Verifications of protocols and Distributed Systems by Computer. In David Sangiorgi and Robert de Simone, editors, CONCUR'98, volume 1466 of Lecture Notes in Computer Science, pages 629--655. Springer-Verlag, 1998.

No context found.

J.F. Groote, F. Monin, and J.C. van de Pol. Checking verifications of protocols and distributed systems by computer. In Proc. 9th Conference on Concurrency Theory, LNCS 1466, pp. 629--655. Springer, 1998.

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