Coverage Criteria for State-Based Testing

2022 ◽  
pp. 1222-1244
Author(s):  
Sonali Pradhan ◽  
Mitrabinda Ray ◽  
Srikanta Patnaik
Keyword(s):  
Early Phase ◽  
Mutation Testing ◽  
Test Cases ◽  
State Machines ◽  
Round Trip ◽  
Coverage Criteria ◽  
State Chart ◽  
Path Testing ◽  
The Given ◽  
Intermediate Graph

State-based testing (SBT) is known as deriving test cases from state machines and examining the dynamic behaviour of the system. It helps to identify various types of state-based faults within a system under test (SUT). For SBT, test cases are generated from state chart diagrams based on various coverage criteria such as All Transition, Round Trip Path, All Transition Pair, All Transition Pair with length 2, All Transition Pair with length 3, All Transition Pair of length 4 and Full Predicate. This article discuses a number of coverage criteria at the design level to find out various types of state-based faults in SBT. First, the intermediate graph is generated from a state chart diagram using an XML parser. The graph is traversed based on the given coverage criteria to generate a sequence of test cases. Then, mutation testing and sneak-path testing are applied on the generated test cases to check the effectiveness of the generated test suite. These two are common methods for checking the effectiveness of test cases. Mutation testing helps in the number of seeded errors covered whereas sneak-path testing basically helps to examine the unspecified behavior of the system. In round trip path (RTP), it is not possible to cover all paths. All transition is not an adequate level of fault detection with more execution time compared to all transition pair (ATP) with length 4 (LN4). In the discussion, ATP with LN4 is the best among all coverage criteria. SBT can able to detect various state-based faults-incorrect transition, missing transition, missing or incorrect event, missing or incorrect action, extra missing or corrupt state, which are difficult to detect in code-based testing. Most of these state-based faults can be avoided, if the testing is conducted at the early phase of design.

Coverage Criteria for State-Based Testing

2019 ◽  
Vol 10 (1) ◽  
pp. 1-20 ◽  
Author(s):  
Sonali Pradhan ◽  
Mitrabinda Ray ◽  
Srikanta Patnaik
Keyword(s):  
Dynamic Behaviour ◽  
Mutation Testing ◽  
Test Cases ◽  
State Machines ◽  
Round Trip ◽  
Coverage Criteria ◽  
State Chart ◽  
Path Testing ◽  
The Given ◽  
Intermediate Graph

State-based testing (SBT) is known as deriving test cases from state machines and examining the dynamic behaviour of the system. It helps to identify various types of state-based faults within a system under test (SUT). For SBT, test cases are generated from state chart diagrams based on various coverage criteria such as All Transition, Round Trip Path, All Transition Pair, All Transition Pair with length 2, All Transition Pair with length 3, All Transition Pair of length 4 and Full Predicate. This article discuses a number of coverage criteria at the design level to find out various types of state-based faults in SBT. First, the intermediate graph is generated from a state chart diagram using an XML parser. The graph is traversed based on the given coverage criteria to generate a sequence of test cases. Then, mutation testing and sneak-path testing are applied on the generated test cases to check the effectiveness of the generated test suite. These two are common methods for checking the effectiveness of test cases. Mutation testing helps in the number of seeded errors covered whereas sneak-path testing basically helps to examine the unspecified behavior of the system. In round trip path (RTP), it is not possible to cover all paths. All transition is not an adequate level of fault detection with more execution time compared to all transition pair (ATP) with length 4 (LN4). In the discussion, ATP with LN4 is the best among all coverage criteria. SBT can able to detect various state-based faults-incorrect transition, missing transition, missing or incorrect event, missing or incorrect action, extra missing or corrupt state, which are difficult to detect in code-based testing. Most of these state-based faults can be avoided, if the testing is conducted at the early phase of design.

scholarly journals From Stress to Shape: Equilibrium of Cloister and Cross Vaults

2021 ◽  
Vol 11 (9) ◽  
pp. 3846
Author(s):  
Andrea Montanino ◽  
Carlo Olivieri ◽  
Giulio Zuccaro ◽  
Maurizio Angelillo
Keyword(s):  
Error Function ◽  
Membrane Surface ◽  
Equilibrium Analysis ◽  
Test Cases ◽  
Order Partial Differential Equation ◽  
Negative Semidefinite ◽  
Historical Heritage ◽  
Masonry Vaults ◽  
Membrane Shape ◽  
The Given

The assessment of the equilibrium and the safety of masonry vaults is of high relevance for the conservation and restoration of historical heritage. In the literature many approaches have been proposed for this tasks, starting from the 17th century. In this work we focus on the Membrane Equilibrium Analysis, developed under the Heyman’s theory of Limit Analysis. Within this theory, the equilibrium of a vault is assessed if it is possible to find at least one membrane surface, between the volume of the vaults, being in equilibrium under the given loads through a purely compressive stress field. The equilibrium of membranes is described by a second order partial differential equation, which is definitely elliptic only when a negative semidefinite stress is assigned, and the shape is the unknown of the problem. The proposed algorithm aims at finding membrane shapes, entirely comprised between the geometry of the vault, in equilibrium with admissible stress fields, through the minimization of an error function with respect to shape parameters of the stress potential, and then, with respect to the boundary values of the membrane shape. The application to two test cases shows the viability of this tool for the assessment of the equilibrium of existing masonry vaults.

An Inverse Inviscid Method for the Design of Quasi-Three-Dimensional Turbomachinery Cascades

1993 ◽  
Vol 115 (1) ◽  
pp. 121-127 ◽  
Author(s):  
E. Bonataki ◽  
P. Chaviaropoulos ◽  
K. D. Papailiou
Keyword(s):  
Differential Equation ◽  
Three Dimensional ◽  
Test Cases ◽  
Elliptic Type ◽  
Flow Angle ◽  
Blade Shape ◽  
Closure Conditions ◽  
Type Boundary ◽  
Absolute Frame ◽  
The Given

The calculation of the blade shape, when the desired velocity distribution is imposed, has been the object of numerous investigations in the past. The object of this paper is to present a new method suitable for the design of turbomachinery stator and rotor blade sections, lying on an arbitrary axisymmetric stream-surface with varying streamtube width. The flow is considered irrotational in the absolute frame of reference and compressible. The given data are the streamtube geometry, the number of blades, the inlet flow conditions and the suction and pressure side velocity distributions as functions of the normalized arc-length. The output of the computation is the blade shape that satisfies the above data. The method solves an elliptic type partial differential equation for the velocity modulus with Dirichlet and periodic type boundary conditions on the (potential function, stream function)-plane (Φ, Ψ). The flow angle field is subsequently calculated solving an ordinary differential equation along the iso-Φ or iso-Ψ lines. The blade coordinates are, finally, computed by numerical integration. A set of closure conditions has been developed and discussed in the paper. The method is validated on several test cases and a discussion is held concerning its application and limitations.

scholarly journals Numerical Solution for the Extrapolation Problem of Analytic Functions

Research ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-10 ◽  
Author(s):  
Nikolaos P. Bakas
Keyword(s):  
Numerical Solution ◽  
Basis Functions ◽  
Test Cases ◽  
Multiple Dimensions ◽  
Error Magnitude ◽  
Approximation Errors ◽  
Rapid Calculation ◽  
Extrapolation Problem ◽  
The Given ◽  
Domain Length

In this work, a numerical solution for the extrapolation problem of a discrete set of n values of an unknown analytic function is developed. The proposed method is based on a novel numerical scheme for the rapid calculation of higher order derivatives, exhibiting high accuracy, with error magnitude of O(10−100) or less. A variety of integrated radial basis functions are utilized for the solution, as well as variable precision arithmetic for the calculations. Multiple alterations in the function’s direction, with no curvature or periodicity information specified, are efficiently foreseen. Interestingly, the proposed procedure can be extended in multiple dimensions. The attained extrapolation spans are greater than two times the given domain length. The significance of the approximation errors is comprehensively analyzed and reported, for 5832 test cases.

scholarly journals Coverage Criteria for Set-Based Specifications

2015 ◽  
Vol 22 (2) ◽  
pp. 316
Author(s):  
Maximiliano Cristiá ◽  
Joaquín Cuenca ◽  
Claudia Frydman
Keyword(s):  
Structural Testing ◽  
Test Cases ◽  
Logical Formula ◽  
Coverage Criteria ◽  
Testing Strategies ◽  
Model Based Testing ◽  
Path Coverage ◽  
Input Domain ◽  
Domain Partition ◽  
Scripting Language

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.

Comparing Graph-Based Algorithms to Generate Test Cases from Finite State Machines

2019 ◽  
Vol 35 (6) ◽  
pp. 867-885
Author(s):  
Matheus Monteiro Mariano ◽  
Érica Ferreira de Souza ◽  
André Takeshi Endo ◽  
Nandamudi Lankalapalli Vijaykumar
Keyword(s):  
Finite State Machines ◽  
Test Cases ◽  
State Machines ◽  
Finite State
Sign in / Sign up

Export Citation Format

Share Document