An automated framework for software test oracle

Shahamiri, Seyed Reza; Kadir, Wan Hazli Wan; Ibrahim, Suhaimi; Hashim, Siti Zaiton Mohd

doi:10.1016/j.infsof.2011.02.006

Cited by 51 publications

(38 citation statements)

References 43 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In the light of the recent emergence of numerous testing techniques that are founded on specific machine learning techniques [2,5,8,12,17,19,22,23,26,28,29], this paper has sought to investigate the practical application use of the PAC framework. The paper shows how the PAC framework can be applied in practice.…”

Section: Discussionmentioning

confidence: 99%

“…Initially, Weyuker's work and subsequent work by Bergadano et al [3,30] focussed on synthesised programs. Since then however, similar approaches have been based upon Artificial Neural Nets [12,22], invariants [8], decision trees [5] and deterministic finite state automata [2,19,23,26,28,29].…”

Section: Testing With Inductive Inferencementioning

confidence: 99%

“…There has been a recent resurgence in techniques that expolit this relationship [3,5,6,8,12,17,19,22,23,26,28,29,30] by inferring models from test sets, and in some cases using these models to elicit further test cases. However, these techniques tend to suffer from two problems: (1) there is no means of predicting how many tests would be required to arrive at an adequate test set and (2) given a partial test set, there is no basis for gauging how close it is to being adequate.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Assessing Test Adequacy for Black-Box Systems without Specifications

Walkinshaw

2011

Testing Software and Systems

View full text Add to dashboard Cite

Abstract. Testing a black-box system without recourse to a specification is difficult, because there is no basis for estimating how many tests will be required, or to assess how complete a given test set is. Several researchers have noted that there is a duality between these testing problems and the problem of inductive inference (learning a model of a hidden system from a given set of examples). It is impossible to tell how many examples will be required to infer an accurate model, and there is no basis for telling how complete a given set of examples is. These issues have been addressed in the domain of inductive inference by developing statistical techniques, where the accuracy of an inferred model is subject to a tolerable degree of error. This paper explores the application of these techniques to assess test sets of black-box systems. It shows how they can be used to reason in a statistically justified manner about the number of tests required to fully exercise a system without a specification, and how to provide a valid adequacy measure for black-box test sets in an applied context.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Testing With Inductive Inferencementioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Assessing Test Adequacy for Black-Box Systems without Specifications

Walkinshaw

2011

Testing Software and Systems

View full text Add to dashboard Cite

show abstract

“…There are two coverage criteria in structural testing: Control-flow coverage [11][12][13] and Data-flow coverage [14][15][16]. The control-flow coverage criterion is chiefly discussed in this paper.…”

Section: C(m D) = True ! C(m P) = Truementioning

confidence: 99%

Improvement of the Baseline Method in Structural Testing

Chen¹,

Hao²,

Xie³

2015

TOAUTOCJ

View full text Add to dashboard Cite

An algorithm based on the generation for baseline path is proposed in this paper. Making use of it, the original baseline path can be generated randomly and automatically. In respect of traversing the basic path group, the algorithm introduces the method of depth-first search to avoid storing more information of branch node and decrease the time of linear traversal. Using the column with S-node with no in-degree and the row with E-node with no out-degree, the case of nodes' value and the number of value cases are stored for reducing the waste in storage. Furthermore, giving priority to the behind path-node when generating a path, the time of judgment for loops is effectively reduced. Theoretical analysis and experimental results show that this new algorithm has an advantage over the original Baseline Method in efficiency and space complexity of the test path generation. The average space complexity is decreased from O(n) to O(log n) , and the time complexity is also reduced to a certain extent.

show abstract

“…But these properties come under different names: invariants [6], specifications [10] and oracles [21]. The Daikon tool [6] discovers assertions (invariants) that hold at certain program points, e.g., method entry and exit.…”

Section: Mining Properties From Logsmentioning

confidence: 99%

Guided Algebraic Specification Mining for Failure Simplification

Elyasov

Prasetya

Hage

2013

Testing Software and Systems

View full text Add to dashboard Cite

Abstract. Software systems often produce logs that capture information about their execution behaviour. When an error occurs, the log file with the error is reported for subsequent analysis. The longer the log file, the harder to identify the cause of the observed error. This problem can be considerably simplified if we reduce the log length, e.g., by removing events which do not contribute towards finding the error. This paper addresses the problem of log reduction by rewriting the reported log in such a way that it preserves the ability to reproduce the same error. The approach exploits rewrite rules inferred from a set of predefined algebraic rewrite rule patterns, exhibiting such properties as commutativity and identity. The paper presents an algorithm for rewrite rules inference, and a terminating reduction strategy based on these rules. Being log-based the inference algorithm is inherently imprecise. So the inferred rules need to be inspected by a human expert before actually being used for rewriting. The approach is language independent and highly flexible. The paper formally defines all used concepts and discusses a prototype implementation of a log reduction framework. The prototype was empirically validated on a web shop application.

show abstract

An automated framework for software test oracle

Cited by 51 publications

References 43 publications

Assessing Test Adequacy for Black-Box Systems without Specifications

Assessing Test Adequacy for Black-Box Systems without Specifications

Improvement of the Baseline Method in Structural Testing

Guided Algebraic Specification Mining for Failure Simplification

Contact Info

Product

Resources

About