Testing with Inputs and Outputs in CSP

Cavalcanti, Ana; Hierons, Robert M.

doi:10.1007/978-3-642-37057-1_26

Cited by 14 publications

(13 citation statements)

References 22 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The CSP testing theory also includes tests for conf , a conformance relation that deals with forbidden deadlocks; together, tests for conf and traces refinement can be used to establish failures refinement. Another interesting failuresbased conformance relation for testing from CSP models takes into account the asymmetry of controllability of inputs and outputs in the interaction with the SUT [6]. It is worth investigating how fault domains can be used to generate finite test sets for these notions of conformance.…”

Section: Discussionmentioning

confidence: 99%

Fault-Based Testing for Refinement in CSP

Cavalcanti¹,

Simão²

2017

Testing Software and Systems

Self Cite

View full text Add to dashboard Cite

The process algebra CSP has been studied as a modeling notation for test derivation. Work has been developed using its trace and failure semantics, and their refinement notions as conformance relations. In this paper, we propose a procedure for online test generation for selection of finite test sets for traces refinement from CSP models, based on the notion of fault domains, that is, focusing on the set of faulty implementations of interest. We investigate scenarios where the verdict of a test campaign can be reached after a finite number of test executions. We illustrate the usage of the procedure with a small case study.

show abstract

Section: Discussionmentioning

confidence: 99%

Fault-Based Testing for Refinement in CSP

Cavalcanti¹,

Simão²

2017

Testing Software and Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…The CSP testing theory also includes tests for conf , a conformance relation that deals with forbidden deadlocks; together, tests for conf and traces refinement can be used to establish failures refinement. Another interesting failures-based conformance relation for testing from CSP models takes into account the asymmetry of controllability of inputs and outputs in the interaction with the SUT [7]. The motivation is exactly work with testing.…”

Section: Discussionmentioning

confidence: 99%

Fault-based refinement-testing for CSP

Cavalcanti

Simão

2019

Software Qual J

Self Cite

View full text Add to dashboard Cite

The process algebra CSP has been studied as a notation for modelbased testing. Theoretical and practical work has been developed using its trace and failure semantics, and their refinement notions as conformance relations. Two sets of tests have been defined and proved to be exhaustive, in the sense that they can identify any SUT that is non-conforming with respect to the relevant refinement relation. However, these sets are usually infinite, and in this case, it is obviously not possible to apply them to verify the conformity of an SUT. Some classical selection criteria based on models have been studied. In this paper, we propose a procedure for online test generation for selection of finite test sets for traces refinement from CSP models. It is based on the notion of fault domains, focusing on the set of faulty implementations of interest. We investigate scenarios where the verdict of a test campaign can be reached after a finite number of test executions. We illustrate the usage of the procedure with some case studies.

show abstract

“…The input-output refusal traces model follows the same principle adopted in input-output stable failures in [5]. States that communicate outputs are not stable, so no refusals are observed.…”

Section: B Input-output Refusal Tracesmentioning

confidence: 99%

“…An adaptation of the standard CSP stable-failures model to handle inputs and outputs has been presented in [5]. It, however, entails severe restrictions on parallelism and renaming; it forbids, for example, sychronisation on inputs and renaming inputs to outputs or viceversa.…”

Section: Introductionmentioning

confidence: 99%

A Suspension-Trace Semantics for CSP

Cavalcanti

Hierons

Nogueira

et al. 2016

2016 10th International Symposium on Theoretical Aspects of Software Engineering (TASE)

Self Cite

View full text Add to dashboard Cite

Abstract-CSP is well established as a process algebra for refinement. Most refinement relations for CSP do not differentiate between inputs and outputs, and so are unsuitable for testing. This paper provides CSP with a denotational semantics based on suspension traces; it gives the traditional CSP operators a novel view, catering for the differences between inputs and outputs. We identify healthiness conditions for the suspension-traces model and include a treatment of termination not contemplated in the context of input-output labelled transition systems. Using our suspension-traces semantics, we provide for CSP a characterisation of the conformance relation ioco, which is widely used in testing. Finally, we propose a strategy to mechanise the verification of conformance according to ioco and suspensiontrace refinement using CSP tools. This work provides the basis for a theory of testing for CSP with inputs and outputs, and opens up the possibility of studying algebraic laws and compositional reasoning techniques based on ioco. Ultimately, it contributes to making CSP models useful for both design and testing of systems.

show abstract

Testing with Inputs and Outputs in CSP

Cited by 14 publications

References 22 publications

Fault-Based Testing for Refinement in CSP

Fault-Based Testing for Refinement in CSP

Fault-based refinement-testing for CSP

A Suspension-Trace Semantics for CSP

Contact Info

Product

Resources

About