Input-output conformance testing based on featured transition systems

Beohar, Harsh; Mousavi, Mohammad Reza

doi:10.1145/2554850.2554949

Cited by 12 publications

(24 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Such extended FTS formalism is also of interest for testing [19,20]. As is the addition of inputs and outputs for ioco conformance [3]. With respect to mutation, we would like to formally investigate the mutant equivalence problem using exact or approximate simulation techniques [13].…”

Section: Resultsmentioning

confidence: 99%

On Featured Transition Systems

Legay

Perrouin

Devroey

et al. 2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Section: Resultsmentioning

confidence: 99%

On Featured Transition Systems

Legay

Perrouin

Devroey

et al. 2017

Lecture Notes in Computer Science

View full text Add to dashboard Cite

“…We define a product derivation operator, reminiscent of the operator in [4,6], that is parameterised by feature constraints. Given a feature constraint, the product derivation operator reduces an FFSM into an FSM representing the selection of products.…”

Section: Product Derivationmentioning

confidence: 99%

“…To our knowledge, however, there only a few pieces of research that extend test models, test case generation and test case execution to the family-based level; examples of such work include earlier delta-oriented techniques such as [24,23,34] and featureoriented approaches [4,5,14]. However, the approach proposed in [4,6] exploits a non-deterministic test case generation algorithm (with no fault model or finite test suite) and hence, validation of test models is not an issue in their approach. Thus, we are not aware of any prior study one extending the FSM-based test-model validation techniques to the family-based setting.…”

Section: Related Workmentioning

confidence: 99%

Validated Test Models for Software Product Lines: Featured Finite State Machines

Fragal

Simão

Mousavi

2017

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Variants of the finite state machine (FSM) model have been extensively used to describe the behaviour of reactive systems. In particular, several model-based testing techniques have been developed to support test case generation and test case executions from FSMs. Most such techniques require several validation properties to hold for the underlying test models. In this paper, we propose an extension of the FSM test model for software product lines (SPLs), named featured finite state machine (FFSM). As the first step towards using FFSMs as test models, we define feature-oriented variants of basic test model validation criteria. We show how the high-level validation properties coincide with the necessary properties on the product FSMs. Moreover, we provide a mechanised tool prototype for checking the feature-oriented properties using satisfiability modulo theory (SMT) solver tools. We investigate the applicability of our approach by applying it to both randomly generated FFSMs as well as those from a realistic case study (the Body Comfort System). The results of our study show that for random FFSMs over 16 independent non-mandatory features, our technique provides substantial efficiency gains for the set of proposed validity checks.

show abstract

“…However, their notion of input refusals refers to a global property rather than being specific to particular states and they also do not distinguish mandatory from optional behaviors. Beohar and Mousavi extend ioco by replacing IOLTS with so-called Featured Transition Systems (FTS) and thereby enhance ioco to express fine-grained behavioral variability as apparent in software product lines [5]. As in our approach, FTS allow the environment to explicitly influence the presence or absence of particular transitions, whereas compositionality properties are not considered.…”

Section: Related Workmentioning

confidence: 99%

Compositionality, Decompositionality and Refinement in Input/Output Conformance Testing

Luthmann¹,

Mennicke²,

Lochau³

2017

Formal Aspects of Component Software

View full text Add to dashboard Cite

We propose an input/output conformance testing theory utilizing Modal Interface Automata with Input Refusals (IR-MIA) as novel behavioral formalism for both the specification and the implementation under test. A modal refinement relation on IR-MIA allows distinguishing between obligatory and allowed output behaviors, as well as between implicitly underspecified and explicitly forbidden input behaviors. The theory therefore supports positive and negative conformance testing with optimistic and pessimistic environmental assumptions. We further show that the resulting conformance relation on IR-MIA, called modal-irioco, enjoys many desirable properties concerning componentbased behaviors. First, modal-irioco is preserved under modal refinement and constitutes a preorder under certain restrictions which can be ensured by a canonical input completion for IR-MIA. Second, under the same restrictions, modal-irioco is compositional with respect to parallel composition of IR-MIA with multi-cast and hiding. Finally, the quotient operator on IR-MIA, as the inverse to parallel composition, facilitates decompositionality in conformance testing to solve the unknown-component problem.

show abstract

Input-output conformance testing based on featured transition systems

Cited by 12 publications

References 10 publications

On Featured Transition Systems

On Featured Transition Systems

Validated Test Models for Software Product Lines: Featured Finite State Machines

Compositionality, Decompositionality and Refinement in Input/Output Conformance Testing

Contact Info

Product

Resources

About