Using Squeeziness to test component-based systems defined as Finite State Machines
Using Squeeziness to test component-based systems defined as Finite State Machines
复制标题
使用 Squeeziness 测试定义为有限状态机的基于组件的系统
DOI:
10.1016/j.infsof.2019.04.012
复制
发表时间:
2019
影响因子:
3.9
通讯作者:
Ibias A
中科院分区:
文献类型:
--
作者:
Ibias A
Context:Testing is the main validation technique used to increase the reliability of software systems. The effectiveness of testing can be strongly reduced byFailed Error Propagation. This situation happens when the System Under Test executes a faulty statement, the state of the system is affected by this fault, but the expected output is observed. Squeeziness is an information theoretic measure designed to quantify the likelihood of Failed Error Propagation and previous work has shown that Squeeziness correlates strongly with Failed Error Propagation in white-box scenarios. Despite its usefulness, this measure, in its current formulation, cannot be used in a black-box scenario where we do not have access to the source code of the components.Objective:The main goal of this paper is to adapt Squeeziness to a black-box scenario and evaluate whether it can be used to estimate the likelihood that a component of a software system introduces Failed Error Propagation.Method:First, we defined our black-box scenario. Specifically, we considered the Failed Error Propagation that a component introduces when it receives its input from another component. We were interested in this since such fault masking makes it more difficult to find faults in thepreviouscomponent when testing. Second, we defined our notion of Squeeziness in this framework. Finally, we carried out experiments in order to evaluate our measure.Results:Our experiments showed a strong correlation between the likelihood of Failed Error Propagation and Squeeziness.Conclusion:We can conclude that our new notion of Squeeziness can be used as a measure that estimates the probability of Failed Error Propagation being introduced by a component. As a result, it has the potential to be used as a measure of testability, allowing testers to assess how easy it is to test either the whole system or a single component. We considered a simple model (Finite State Machines) but the notions and results can be extended/adapted to deal with more complex state-based models, in particular, those containing data.
登录
查看更多内容
DOI:
--
发表时间:
2014
期刊:
Information Security Conference
影响因子:
--
作者:
Michele Boreale;Michela Paolini
通讯作者:
Michela Paolini
DOI:
--
发表时间:
2000
期刊:
International Symposium on Software Testing and Analysis
影响因子:
--
作者:
M. Woodward;Z. Al
通讯作者:
Z. Al
DOI:
--
发表时间:
2000
期刊:
Modeling and Verification of Parallel Processes
影响因子:
--
作者:
A. Petrenko
通讯作者:
A. Petrenko
DOI:
10.1016/j.ipl.2012.01.004
发表时间:
2012
期刊:
Inf. Process. Lett.
影响因子:
--
作者:
D. Clark;R. Hierons
通讯作者:
R. Hierons
DOI:
--
发表时间:
2013
期刊:
International Journal on Software Tools for Technology Transfer (STTT)
影响因子:
--
作者:
M. Shafique;Y. Labiche
通讯作者:
Y. Labiche