Extending the Test Template Framework to Deal with Axiomatic Descriptions, Quantifiers and Set Comprehensions

Cuenca

Frydman

2015

RITA

Self Cite

Model-based testing (MBT) studies how test cases are generated from a model of the system under test (SUT). Many MBT methods rely on building an automaton from the model and then they generate test cases by covering the automaton with different path coverage criteria. However, if a model of the SUT is a logical formula over some complex mathematical theories (such as set theory) it may be more natural or intuitive to apply coverage criteria directly over the formula. On the other hand, domain partition, i.e. the partition of the input domain of model operations, is one of the main techniques in MBT. Partitioning is conducted by applying different rules or heuristics. Engineers may find it difficult to decide what, where and how these rules should be applied. In this paper we propose a set of coverage criteria based on domain partition for set-based specifications. We call them testing strategies. Testing strategies play a similar role to path-or data-based coverage criteria in structural testing. Furthermore, we show a partial order of testing strategies as is done in structural testing. We also describe an implementation of testing strategies for the Test Template Framework, which is a MBT method for the Z notation; and a scripting language that allows users to implement testing strategies.

Section: Discussionmentioning

confidence: 99%

“…The rules shown here can be applied to languages such as Z and B. There are more partitioning rules for such notations but for the sake of brevity we do not mention them here [9]. Users of other specification languages may adapt these rules and they may define others tailored to their specific languages.…”

Section: Partitioning Rulesmentioning

confidence: 99%

Coverage Criteria for Set-Based Specifications

Cuenca

Frydman

2015

RITA

Self Cite

“…In a sense, this is all that it is worth to be tested of insert given that the correctness of the sorting algorithm implemented by sort was already tested. Indeed, for example, if tactics SP [8] and UQ [9] are applied to InsertSort 1 , then sort will be tested with empty and non-empty lists of several lengths and where x ? belongs and does not belong to them.…”

Section: Integration Testing Within the Ttfmentioning

confidence: 99%

“…In this section we present just the main concepts of the TTF and Fastest; for deeper presentations consult [25,8,9]. Fastest generates test cases for each operation schema selected by the user in a Z model.…”

Section: Introduction To the Ttf And Fastestmentioning

confidence: 99%

See 1 more Smart Citation

Integration Testing in the Test Template Framework

Fundamental Approaches to Software Engineering

Mesuro

Frydman³

2014

Self Cite

Abstract. The Test Template Framework (TTF) is a model-based testing method for the Z notation, originally proposed for unit testing. In this paper we analyze how the TTF can be extended to integration testing. Since integration testing is related to software design, we decided to investigate the relation between the TTF and the uses relation, a key element in David Parnas' design theory. We propose how a Z specification should be structured for the TTF to be able to generate integration tests by following the uses relation. The problem of stub generation and the kinds of errors that these integration tests can discover are also discussed.

Tool support for the Test Template Framework

Softw. Test. Verif. Reliab.

Albertengo²,

Frydman³

et al. 2012

Self Cite

SUMMARY This paper describes tool support that has been implemented for the Test Template Framework (TTF). The TTF is a model‐based testing (MBT) method that is especially well suited for unit testing from Z specifications. Although the TTF is a sound MBT method and it has been widely referenced since its first publication, attention in recent years has decayed. In fact, some have argued that generating abstract test cases following the TTF is a manual task requiring its users to perform complex predicate manipulations. This paper shows that these observations are dubious by describing Fastest, a tool that implements solutions for all these issues and, according to many experiments, produces abstract test cases for more than 80% of the satisfiable test specifications. Furthermore, it is claimed that Fastest fulfils the needs of the Z user community regarding MBT tools, which is supported with a range of case studies. Copyright © 2012 John Wiley & Sons, Ltd.