Guided Test Generation from CSP Models

Nogueira, Sidney C.; Sampaio, Augusto; Mota, Alexandre

doi:10.1007/978-3-540-85762-4_18

Cited by 24 publications

(22 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…[27] proposes two approaches that cope with non-determinism: modular model checking of a composition of the mutant and the specification, and incremental test generation via observers and traditional model checking. [28] also considers non-determinism. It uses the model checker/refinement checker for FDR (Failures-Divergence Refinement) for the CSP process algebra [29] to generate test cases.…”

Section: Related Workmentioning

confidence: 98%

Efficient Refinement Checking for Model-Based Mutation Testing

Aichernig

Jöbstl

2012

2012 12th International Conference on Quality Software

View full text Add to dashboard Cite

In model-based mutation testing, a test model is mutated for test case generation. The resulting test cases are able to detect whether the faults in the mutated models have been implemented in the system under test. For this purpose, a conformance check between the original and the mutated model is required. We have developed an approach for conformance checking of action systems, which are well-suited to specify reactive and non-deterministic systems. We rely on constraint solving techniques. Both, the conformance relation and the transition relation are encoded as constraint satisfaction problems. Earlier results showed the potential of our constraintbased approach to outperform explicit conformance checking techniques, which often face state space explosion. In this work, we go one step further and show optimisations that really boost our performance. In our experiments, we could reduce our runtimes by 80%.

show abstract

Section: Related Workmentioning

confidence: 98%

Efficient Refinement Checking for Model-Based Mutation Testing

Aichernig

Jöbstl

2012

2012 12th International Conference on Quality Software

View full text Add to dashboard Cite

show abstract

“…In previous work [18] we have also considered a separate set of events to abstractly represent state conditions, but in our current approach conditions are more concretely modeled as expressions on state variables. In any case, this issue is not relevant for this work, which explores a connection between cspio and ioco, as well as compositional properties for cspio.…”

Section: Csp Input-output Conformancementioning

confidence: 99%

“…In previous work [18], we introduced a testing theory based on the process algebra CSP [12,20,22]. We defined a conformance relation, cspio, that distinguishes input and output, based on the traces model of CSP.…”

Section: Introductionmentioning

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

Self Cite

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

“…For example, Buth [31] used CSP, together with the FDR model checker to compare mental and system models associated with an aircraft's autopilot system, and evaluate whether the mental models were valid refinements of the system's specification. CSP has also be used to verify instancebased behavioural models such as use cases [32] and scenarios [33], and reasoning about interactions between multiple human actors; this was demonstrated by Jirotka and Luff, who used CSP to model work practices associated with shares trading [34].…”

Section: Introducing Csp and Fdrmentioning

confidence: 99%

Gulfs of expectation: eliciting and verifying differences in trust expectations using personas

2016

View full text Add to dashboard Cite

Personas are a common tool used in Human Computer Interaction to represent the needs and expectations of a system's stakeholders, but they are also grounded in large amounts of qualitative data. Our aim is to make use of this data to anticipate the differences between a user persona's expectations of a system, and the expectations held by its developers. This paper introduces the idea of gulfs of expectation -the gap between the expectations held by a user about a system and its developers, and the expectations held by a developer about the system and its users. By evaluating these differences in expectation against a formal representation of a system, we demonstrate how differences between the anticipated user and developer mental models of the system can be verified. We illustrate this using a case study where persona characteristics were analysed to identify divergent behaviour and potential security breaches as a result of differing trust expectations.

show abstract

Guided Test Generation from CSP Models

Cited by 24 publications

References 7 publications

Efficient Refinement Checking for Model-Based Mutation Testing

Efficient Refinement Checking for Model-Based Mutation Testing

Compositional Verification of Input-Output Conformance via CSP Refinement Checking

Gulfs of expectation: eliciting and verifying differences in trust expectations using personas

Contact Info

Product

Resources

About