#### DMCA

## A generic theorem prover of CSP refinement (2005)

### Cached

### Download Links

- [staff.aist.go.jp]
- [www.cs.swan.ac.uk]
- [www.cs.swan.ac.uk]
- [www.cs.swan.ac.uk]
- DBLP

### Other Repositories/Bibliography

Venue: | In TACAS 2005, LNCS 3440 |

Citations: | 24 - 13 self |

### Citations

4102 | Communicating Sequential Processes,
- Hoare
- 1978
(Show Context)
Citation Context ...ôle. It has proved to be suitable at the level of requirement specification, at the level of design specifications, and also for formal refinement proofs [2]. In this context, the process algebra Csp =-=[11, 21]-=- has successfully been applied in various areas, ranging from train control systems [5] over software for the international space station [3, 4] to the verification of security protocols [23]. Concern... |

3194 | Model Checking
- Clarke, Grumberg, et al.
- 1999
(Show Context)
Citation Context ...rover’s tactic csp hnf tac, which transforms any expression into a head normal form, and csp decompo, which decomposes Csp-operators (line 18). 5.2 The Dining Mathematicians The dining mathematicians =-=[7]-=- are a classical mutual exclusion problem: There are two mathematicians living at the same place, whose life is focused on two activities, namely thinking (TH0 and TH1, respectively) and eating (EAT0 ... |

747 |
Theory and Practice of Concurrency
- Roscoe
- 1998
(Show Context)
Citation Context ...ôle. It has proved to be suitable at the level of requirement specification, at the level of design specifications, and also for formal refinement proofs [2]. In this context, the process algebra Csp =-=[11, 21]-=- has successfully been applied in various areas, ranging from train control systems [5] over software for the international space station [3, 4] to the verification of security protocols [23]. Concern... |

652 | PVS: A prototype verification system
- OWRE, SHANKAR, et al.
- 1992
(Show Context)
Citation Context ... As Spc is again a sequential process, this refinement result also establishes deadlock-freedom of (Sys n). 6 Related Work Based on general purpose theorem provers like Isabelle [18], HOL [10] or PVS =-=[17]-=-, various tools for theorem proving over process algebras have been presented. Closest to our approach are the Csp encodings of Tej/Wolff [26, 25] and Schneider/Dutertre [8, 24]. Tej/Wolff suggest a s... |

126 |
The 3x+1 problem and its generalizations
- Lagarias
- 1985
(Show Context)
Citation Context ...dining mathematicians which clearly has the desired exclusion property. This 11 The function involved here is the so-called Collatz function which is studied in the context of the 3x + 1 problem, see =-=[13]-=- for a survey.sA Generic Theorem Prover of CSP Refinement 121 abstraction Spc consists only of three states, which stand for the situations ‘both mathematicians think’ TH0 TH1 and ‘one mathematician e... |

90 |
Modelling and Analysis of Security Protocols: the CSP Approach
- Ryan, Schneider
- 2001
(Show Context)
Citation Context ... Csp [11, 21] has successfully been applied in various areas, ranging from train control systems [5] over software for the international space station [3, 4] to the verification of security protocols =-=[23]-=-. Concerning tool support for Csp, the model checker FDR [15] is without doubt the standard proof tool for Csp. It allows for refinement proofs as well as for deadlock and livelock analysis. However, ... |

72 |
A Semantic Study of Data Independence with Applications to Model Checking
- Lazić
- 1999
(Show Context)
Citation Context ...ture, we intend to include the failure-divergence model N in CspProver. Furthermore, we will integrate Csp-Prover with the model checker FDR. In this context the theory of data independence, see e.g. =-=[14]-=-, will play an important rôle. Continuing the work on EP2 and applying Csp-Prover to other cases122 Y. Isobe and M. Roggenbach studies, e.g. of the area of train control systems, will help to develop ... |

46 |
Isabelle: A Generic Theorem Prover. LNCS 828
- Paulson
- 1994
(Show Context)
Citation Context ...itecture of Csp-Prover is discussed in detail. Sect. 5 demonstrates how to apply Csp-Prover in various settings. Finally, we relate Csp-Prover to similar tools. 2 The Theorem Prover Isabelle Isabelle =-=[18]-=- is an interactive theorem prover. Theorems to be proved are entered as goals. A goal can be manipulated by proof-commands referring to a set of predefined inference rules producing new goals. Such ru... |

36 | Using a PVS Embedding of CSP to Verify Authentication Protocols
- Dutertre, Schneider
- 1997
(Show Context)
Citation Context ...he use of concrete data types. Furthermore, in practical applications it is often hard to deal with the state explosion problem. In this context, the use of theorem provers has been suggested e.g. by =-=[26, 25, 8, 24]-=- in order to complement the well-established technique of model checking. ∗ Supported by Royal Society with Short Visit Grants. 1 On the LHS of a refinement check, see [22] for a precise characterisat... |

32 | CSP CASL - A new Integration of Process Algebra and Algebraic Specification
- Roggenbach
- 2003
(Show Context)
Citation Context ...2 "AC == LET ACDef IN (<Acquirer> |[range c]| <Terminal>)" Fig. 6. EP2 Specification at the Abstract Component Description Level In [9], major parts of the EP2 system have been formalised in Csp-Casl =-=[20]-=-. Following the structure of the original EP2 documents, the specifications presented in [9] can be classified to be e.g. on the Architectural Level, on the Abstract Component Description Level, or on... |

24 | A Corrected Failure-Divergence Model for Csp in Isabelle/Hol
- Tej, Wolff
- 1997
(Show Context)
Citation Context ...he use of concrete data types. Furthermore, in practical applications it is often hard to deal with the state explosion problem. In this context, the use of theorem provers has been suggested e.g. by =-=[26, 25, 8, 24]-=- in order to complement the well-established technique of model checking. ∗ Supported by Royal Society with Short Visit Grants. 1 On the LHS of a refinement check, see [22] for a precise characterisat... |

20 | Deadlock analysis for a fault-tolerant system
- Buth, Kouvaras, et al.
- 1997
(Show Context)
Citation Context ... proofs [2]. In this context, the process algebra Csp [11, 21] has successfully been applied in various areas, ranging from train control systems [5] over software for the international space station =-=[3, 4]-=- to the verification of security protocols [23]. Concerning tool support for Csp, the model checker FDR [15] is without doubt the standard proof tool for Csp. It allows for refinement proofs as well a... |

19 | Combining methods for the livelock analysis of a fault-tolerant system
- Buth, Peleska, et al.
- 1998
(Show Context)
Citation Context ... proofs [2]. In this context, the process algebra Csp [11, 21] has successfully been applied in various areas, ranging from train control systems [5] over software for the international space station =-=[3, 4]-=- to the verification of security protocols [23]. Concerning tool support for Csp, the model checker FDR [15] is without doubt the standard proof tool for Csp. It allows for refinement proofs as well a... |

19 | Towards a formal specification of an electronic payment systems
- Gimblett, Roggenbach, et al.
- 2005
(Show Context)
Citation Context ...onse) -> <AcConfM>" 20 21 constdefs AC :: "(ACName, Event) procRC" 22 "AC == LET ACDef IN (<Acquirer> |[range c]| <Terminal>)" Fig. 6. EP2 Specification at the Abstract Component Description Level In =-=[9]-=-, major parts of the EP2 system have been formalised in Csp-Casl [20]. Following the structure of the original EP2 documents, the specifications presented in [9] can be classified to be e.g. on the Ar... |

9 | Process Algebra in Pvs
- Basten, Hooman
- 1999
(Show Context)
Citation Context ... Furthermore, in offering both, the cms and the cpo approach, it allows to use the more convenient and the more promising setting for any proof step. Alternative to encoding a denotational semantics, =-=[6, 19, 1]-=- base their encodings on an axiomatic semantics of the process algebra. As discussed in Sect. 3.2, such an approach is not an option in the context of Csp. 7 Conclusion and Future Work We have shown a... |

9 | On the expressive power of CSP refinement - Roscoe - 2003 |

8 | Verifying authentication protocol implementations
- Schneider
- 2002
(Show Context)
Citation Context ...he use of concrete data types. Furthermore, in practical applications it is often hard to deal with the state explosion problem. In this context, the use of theorem provers has been suggested e.g. by =-=[26, 25, 8, 24]-=- in order to complement the well-established technique of model checking. ∗ Supported by Royal Society with Short Visit Grants. 1 On the LHS of a refinement check, see [22] for a precise characterisat... |

6 |
Combining Interaction and Automation in Process Algebra Veri
- Camilleri, Inverardi, et al.
- 1991
(Show Context)
Citation Context ... Furthermore, in offering both, the cms and the cpo approach, it allows to use the more convenient and the more promising setting for any proof step. Alternative to encoding a denotational semantics, =-=[6, 19, 1]-=- base their encodings on an axiomatic semantics of the process algebra. As discussed in Sect. 3.2, such an approach is not an option in the context of Csp. 7 Conclusion and Future Work We have shown a... |

5 |
Failures-divergence refinement: FDR2. http://www.fsel.com
- Limited
(Show Context)
Citation Context ... ranging from train control systems [5] over software for the international space station [3, 4] to the verification of security protocols [23]. Concerning tool support for Csp, the model checker FDR =-=[15]-=- is without doubt the standard proof tool for Csp. It allows for refinement proofs as well as for deadlock and livelock analysis. However, in general FDR restricts Csp specifications to finite state s... |

5 |
HOL-CSP: Mechanised Formal Development of Concurrent Processes
- Tej
- 1999
(Show Context)
Citation Context |

4 |
Model-checking the architectural design of a fail-safe communication system for railway interlocking systems
- Buth, Schrönen
- 1999
(Show Context)
Citation Context ... design specifications, and also for formal refinement proofs [2]. In this context, the process algebra Csp [11, 21] has successfully been applied in various areas, ranging from train control systems =-=[5]-=- over software for the international space station [3, 4] to the verification of security protocols [23]. Concerning tool support for Csp, the model checker FDR [15] is without doubt the standard proo... |

2 | Algebraic proof assistants in HOL
- Groenboom, Hendriks, et al.
(Show Context)
Citation Context ... Furthermore, in offering both, the cms and the cpo approach, it allows to use the more convenient and the more promising setting for any proof step. Alternative to encoding a denotational semantics, =-=[6, 19, 1]-=- base their encodings on an axiomatic semantics of the process algebra. As discussed in Sect. 3.2, such an approach is not an option in the context of Csp. 7 Conclusion and Future Work We have shown a... |

1 |
Introduction to HOL. Cambrige
- Gordon, Melham
(Show Context)
Citation Context ...ble at [12]. As Spc is again a sequential process, this refinement result also establishes deadlock-freedom of (Sys n). 6 Related Work Based on general purpose theorem provers like Isabelle [18], HOL =-=[10]-=- or PVS [17], various tools for theorem proving over process algebras have been presented. Closest to our approach are the Csp encodings of Tej/Wolff [26, 25] and Schneider/Dutertre [8, 24]. Tej/Wolff... |