Results 1 
6 of
6
Process Algebra in PVS
 Proc. of the International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS '99), volume 1579 of Lecture Notes in Computer Science
, 1999
"... The aim of this work is to investigate mechanical support for process algebra, both for concrete applications and theoretical properties. Two approaches are presented using the verification system PVS. One approach declares process terms as an uninterpreted type and specifies equality on terms by ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
The aim of this work is to investigate mechanical support for process algebra, both for concrete applications and theoretical properties. Two approaches are presented using the verification system PVS. One approach declares process terms as an uninterpreted type and specifies equality on terms by axioms. This is convenient for concrete applications where the rewrite mechanisms of PVS can be exploited. For the verification of theoretical results, often induction principles are needed. They are provided by the second approach where process terms are defined as an abstract datatype with a separate equivalence relation. 1 Introduction We investigate the possibilities of obtainingmechanical support for equational reasoning in process algebra. In particular, we consider ACPstyle process algebras [2, 3]. In this framework, processes are represented by terms constructed from atoms (denoting atomic actions) and operators such as choice (nondeterminism), sequential composition, and para...
Algebraic Verification of a Distributed Summation Algorithm
, 1996
"... In this note we present an algebraic verification of Segall's Propagation of Information with Feedback (PIF) algorithm. This algorithm serves as a nice benchmark for verification exercises (see [2, 13, 8]). The verification is based on the methodology presented in [7] and demonstrates its applica ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
In this note we present an algebraic verification of Segall's Propagation of Information with Feedback (PIF) algorithm. This algorithm serves as a nice benchmark for verification exercises (see [2, 13, 8]). The verification is based on the methodology presented in [7] and demonstrates its applicability to distributed algorithms.
Checking Verifications of Protocols and Distributed Systems By Computer
, 1998
"... We provide a treatise about checking proofs of distributed systems by computer using general purpose proof checkers. In particular, we present two approaches to verifying and checking the verification of the Sequential Line Interface Protocol (SLIP), one using rewriting techniques and one using the ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We provide a treatise about checking proofs of distributed systems by computer using general purpose proof checkers. In particular, we present two approaches to verifying and checking the verification of the Sequential Line Interface Protocol (SLIP), one using rewriting techniques and one using the socalled cones and foci theorem. Both verifications are carried out in the setting of process algebra. Finally, we present an overview of literature containing checked proofs. Note: The research of the second author is supported by Human Capital Mobility (HCM). 1 Proof checkers Anyone trying to use a proof checker, e.g. Isabelle [67, 68], HOL [29], Coq [20], PVS [78], BoyerMoore [14] or many others that exist today has experienced the same frustration. It is very difficult to prove even the simplest theorem. In the first place it is difficult to get acquainted to the logical language of the system. Most systems employ higher order logics that are extremely versatile and expressive. Howev...
The tree identify protocol of IEEE 1394
 Proceedings of the 3rd ERCIM Int. Workshop on Formal Methods for Industrial Critical Systems (Amsterdam, The Netherlands
, 1998
"... We specify the tree identify protocol of a high performance serial multimedia bus (IEEE standard 1394 [IEE95]) in three different levels of detail using ¯CRL [GP95]. We propose using the cones and foci verification technique of Groote and Springintveld [GS95] to show the descriptions equivalent und ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We specify the tree identify protocol of a high performance serial multimedia bus (IEEE standard 1394 [IEE95]) in three different levels of detail using ¯CRL [GP95]. We propose using the cones and foci verification technique of Groote and Springintveld [GS95] to show the descriptions equivalent under branching bisimulation. The proof of the equivalence of the two more abstract specifications is shown in detail and the proof of the equivalence of the most abstract and the more complex description, which is work in progress, is sketched. 1 Introduction Much time and effort is expended in the development of new techniques for description and analysis of (computer) systems; however, many of these techniques remain the preserve only of their inventors, and are never widely used. This is often due to the sharp learning curve required to adopt them; many verification techniques have complex theoretical underpinnings, and require sophisticated mathematical skills to apply them. The study pre...
Analysis of an industrial system
, 2003
"... Studying industrial systems by simulation enables the designer to study their dynamic behaviour and to determine characteristics of the system. Unfortunately, simulation also has some disadvantages. These can be overcome by using formal methods. Formal methods allow a thorough analysis of the possi ..."
Abstract
 Add to MetaCart
Studying industrial systems by simulation enables the designer to study their dynamic behaviour and to determine characteristics of the system. Unfortunately, simulation also has some disadvantages. These can be overcome by using formal methods. Formal methods allow a thorough analysis of the possible behaviours of a system, parameterised system analysis and a modular approach to the analysis of systems. We present a case study in which a model of an industrial system is studied in a formal way. For this purpose, the model is first specified and simulated using the CSPbased executable specification language χ. The model is translated into a model in the process algebra µCRL. This enables us to give a correctness proof of the parameterised model and to study the model in isolation.