On Comparing and Complementing two MBT approaches

Cristiá, Maximiliano; Júnior, Valdivino Alexandre de Santiago; Vijaykumar, Nandamudi Lankalapalli

doi:10.1109/latw.2010.5550339

Cited by 8 publications

(3 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Besides, testing strategies embody the experience and knowledge gained after applying MBT to several projects and case studies [12,7]. In this sense, the concept of testing strategy is not the mere assembly of partitioning rules nor their blind application to each statement of the specification.…”

Section: Discussionmentioning

confidence: 99%

Coverage Criteria for Set-Based Specifications

Cristiá

Cuenca

Frydman

2015

RITA

View full text Add to dashboard 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.

show abstract

Section: Discussionmentioning

confidence: 99%

Coverage Criteria for Set-Based Specifications

Cristiá

Cuenca

Frydman

2015

RITA

View full text Add to dashboard Cite

show abstract

“…Since we started with the Fastest project we used a number of case studies (Z specifications) to test and validate different aspects of the tool [11,8,12,10,7]. At the moment we have eleven case studies to test the test case generation algorithm described in Section 4.…”

Section: Empirical Assessmentmentioning

confidence: 99%

Applying SMT Solvers to the Test Template Framework

Cristiá

Frydman

2012

Electron. Proc. Theor. Comput. Sci.

View full text Add to dashboard Cite

The Test Template Framework (TTF) is a model-based testing method for the Z notation. In the TTF, test cases are generated from test specifications, which are predicates written in Z. In turn, the Z notation is based on first-order logic with equality and Zermelo-Fraenkel set theory. In this way, a test case is a witness satisfying a formula in that theory. Satisfiability Modulo Theory (SMT) solvers are software tools that decide the satisfiability of arbitrary formulas in a large number of built-in logical theories and their combination. In this paper, we present the first results of applying two SMT solvers, Yices and CVC3, as the engines to find test cases from TTF's test specifications. In doing so, shallow embeddings of a significant portion of the Z notation into the input languages of Yices and CVC3 are provided, given that they do not directly support Zermelo-Fraenkel set theory as defined in Z. Finally, the results of applying these embeddings to a number of test specifications of eight cases studies are analysed.

show abstract

“…Such consideration includes formal model/language specifications and other non-formal notations, like Unified Modeling Language (UML) models (OMG 2007). Among the formal methods used for system and acceptance model-based test case generation are Statecharts (Harel 1987;Santiago et al 2008b), Finite State Machines (FSMs) (Sidhu and Leung 1989), and Z (Spivey 1989;Cristiá et al 2010).…”

Section: Introductionmentioning

confidence: 99%

Generating model-based test cases from natural language requirements for space application software

Júnior

Vijaykumar

2011

Software Qual J

View full text Add to dashboard Cite

Natural Language (NL) deliverables suffer from ambiguity, poor understandability, incompleteness, and inconsistency. Howewer, NL is straightforward and stakeholders are familiar with it to produce their software requirements documents. This paper presents a methodology, SOLIMVA, which aims at model-based test case generation considering NL requirements deliverables. The methodology is supported by a tool that makes it possible to automatically translate NL requirements into Statechart models. Once the Statecharts are derived, another tool, GTSC, is used to generate the test cases. SOLIMVA uses combinatorial designs to identify scenarios for system and acceptance testing, and it requires that a test designer defines the application domain by means of a dictionary. Within the dictionary there is a Semantic Translation Model in which, among other features, a word sense disambiguation method helps in the translation process. Using as a case study a space application software product, we compared SOLIMVA with a previous manual approach developed by an expert under two aspects: test objectives coverage and characteristics of the Executable Test Cases. In the first aspect, the SOLIMVA methodology not only covered the test objectives associated to the expert's scenarios but also proposed a better strategy with test objectives clearly separated according to the directives of combinatorial designs. The Executable Test Cases derived in accordance with the SOLIMVA methodology not only possessed similar characteristics with the expert's Executable Test Cases but also predicted behaviors that did not exist in the expert's strategy. The key benefits from applying the SOLIMVA methodology/tool within a Verification and Validation process are the ease of use and, at the same time, the support of a formal method consequently leading to a potential acceptance of the methodology in complex software projects.Keywords Model-based testing Á Natural language requirements Á Semantic translation model Á Word sense disambiguation Á Statecharts

show abstract

On Comparing and Complementing two MBT approaches

Cited by 8 publications

References 21 publications

Coverage Criteria for Set-Based Specifications

Coverage Criteria for Set-Based Specifications

Applying SMT Solvers to the Test Template Framework

Generating model-based test cases from natural language requirements for space application software

Contact Info

Product

Resources

About