Testing for Refinement in CSP

Cavalcanti, Ana; Gaudel, Marie-Claude

doi:10.1007/978-3-540-76650-6_10

Cited by 33 publications

(68 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [21], two conformance relations are defined, based on the traces and on the failures-divergences models of CSP, and refinement is used to check whether conformance holds, in a similar way as we do here. An instantiation of a well-established theory of formal testing [9] to CSP, using traces and failures refinement as the notion of correctness, is reported in [7]. Compositionality is not explicitly addressed in any of these works.…”

Section: Discussionmentioning

confidence: 99%

“…Compositionality is not explicitly addressed in any of these works. Nevertheless, in [7], compositionality is a direct consequence of adopting one of the CSP semantic models as the conformance relation. None of these works, however, distinguishes input from output.…”

Section: Discussionmentioning

confidence: 99%

“…This relation assumes as test hypothesis [7] that there is a CSP process which specifies an implementation under test (IUT), say IUT . The alphabet of IUT is also assumed to be known, and split into two disjoint sets: inputs and outputs.…”

Section: Definition 10 (I/o External Choice) Consider the Following mentioning

confidence: 99%

See 2 more Smart Citations

Compositional Verification of Input-Output Conformance via CSP Refinement Checking

Sampaio

Nogueira

Mota

2009

Formal Methods and Software Engineering

View full text Add to dashboard Cite

Abstract. This paper contributes to a testing theory, based on the CSP process algebra, whose conformance relation (cspio) distinguishes input and output events. Although cspio has been defined in terms of the standard CSP traces model, we show that our theory can be immediately extended to address deadlock, outputlock and livelock situations if a special output event is used to represent quiescence. This is formally established by showing that this broader view of cspio is equivalent to Tretmans' ioco relation. Furthermore, we address compositional conformance verification, establishing compositionality properties for cspio with respect to process composition operators. Our testing theory has been adopted in an industrial context involving a collaboration with Motorola, whose focus is on the testing of mobile applications. Some examples are presented to illustrate the overall approach.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

Compositional Verification of Input-Output Conformance via CSP Refinement Checking

Sampaio

Nogueira

Mota

2009

Formal Methods and Software Engineering

View full text Add to dashboard Cite

show abstract

“…So, most methods assume that the SUT is divergence free. This is equivalent to identifying divergence with deadlock in the unknown models of the systems under test; most authors, including us in [5], circumvent the problem of observability in this way. If the SUT is divergent, the divergence is detected as a (probably forbidden) deadlock and reported as such by the verdict of the tests.…”

Section: Process-algebra Based Formal Testingmentioning

confidence: 99%

“…In our own previous work [5], we have instantiated Gaudel's long-standing theory of formal testing [12] to CSP [19]. We now face the challenge of a richer language: Circus [6], which combines CSP with Z [20] and Morgan's refinement calculus [17] to provide a notation that supports refinement of reactive systems with state.…”

Section: Introductionmentioning

confidence: 99%

A Note on Traces Refinement and the conf Relation in the Unifying Theories of Programming

Cavalcanti

Gaudel

2010

Unifying Theories of Programming

Self Cite

View full text Add to dashboard Cite

Abstract. There is a close relation between the failures-divergences and the UTP models of CSP, but they are not equivalent. For example, miracles are not available in the failures-divergences model; the UTP theory is richer and can be used to give semantics to data-rich process algebras like Circus. Previously, we have defined functions that calculate the failuresdivergences model of a CSP process characterised by a UTP relation. In this note, we use these functions to calculate the UTP characterisations of traces refinement and of the conf relation that is widely used in testing. In addition, we prove that the combination of traces refinement and conf corresponds to refinement of processes in Circus. This result is the basis for a formal testing technique based on Circus; as usual in testing, we restrict ourselves to divergence-free processes.

show abstract

Sound and mechanised compositional verification of input‐output conformance

Sampaio

Nogueira

Mota

et al. 2013

Software Testing Verif & Rel

View full text Add to dashboard Cite

SUMMARYThis 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.

show abstract

Testing for Refinement in CSP

Cited by 33 publications

References 18 publications

Compositional Verification of Input-Output Conformance via CSP Refinement Checking

Compositional Verification of Input-Output Conformance via CSP Refinement Checking

A Note on Traces Refinement and the conf Relation in the Unifying Theories of Programming

Sound and mechanised compositional verification of input‐output conformance

Contact Info

Product

Resources

About