Name
Abstract | ||
|---|---|---|
AbstractThis paper mechanises conformance verification in the setting of the CSP process algebra. The verification strategy is captured by a theorem stated as a process refinement expression, which can be verified by a model checker such as FDR. The conformance relation, cspio, distinguishes input and output events. The process algebraic framework of CSP is used to address compositional conformance verification by establishing compositionality properties for cspio with respect to the CSP operators. Although cspio has been defined in the standard CSP traces model, one can address quiescence situations using a special output event, in which case it is formally established that cspio is equivalent to Tretmans ioco. All the results have been mechanically proved using the CSP-Prover. The proposed testing theory has been adopted in an industrial context involving collaboration with Motorola, on testing mobile applications. Several examples and a case study are presented to illustrate the overall approach. Copyright © 2013 John Wiley & Sons, Ltd. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1002/stvr.1498 | Periodicals |
Keywords | Field | DocType |
CSP,input-output conformance,conformance verification,compositional conformance | Principle of compositionality,Model checking,Algebraic number,Computer science,Test theory,Theoretical computer science,Input/output,Conformance testing,Operator (computer programming),Process calculus,Reliability engineering | Journal |
Volume | Issue | ISSN |
24 | 4 | 0960-0833 |
Citations | PageRank | References |
4 | 0.42 | 25 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Augusto Sampaio | 1 | 501 | 43.38 |
| Sidney Nogueira | 2 | 49 | 5.69 |
| Alexandre Cabral Mota | 3 | 199 | 18.27 |
| Yoshinao Isobe | 4 | 58 | 7.84 |