Test Case Optimization Based on State Transition Reduction

Xi Guo; Jian Yong Wang

doi:10.4028/www.scientific.net/AMM.533.432

Paper Titles

The Assessing Method of Mental Concentration Based on the EEG Evaluation Index
p.411

3D Texture Analysis of Corpus Caliosum Based on MR Images Inpatients with Alzheimer’s Disease and Mild Cognitive Impairment
p.415

Brief Discussion on PSP and its Application and Implementation in Software Engineering Management
p.423

Test Case Optimization Based on State Transition Reduction
p.432

Comparative Study on Mobile Search Engines
p.436

Information Integration System and its Implementation Based on Semantic
p.440

Information Integration System Based on Ontology
p.444

Study on Query Optimization of Distributed Database
p.448

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vol. 533Test Case Optimization Based on State Transition...

Test Case Optimization Based on State Transition Reduction

Abstract:

Due to the large number of status transition of large scale software system, an efficient test case generation method based on predicate abstraction is proposed aiming to the problem of status space explosion. The reduced abstract status is solved via mapping the status sets between the real status and abstract status, and then generated the reduced test case based on the transition of the status. The experimental results show that this method can reduce the status of the real model in a high efficient, and generate a smaller set of test case.

You might also be interested in these eBooks

Modern Tendencies in Engineering Sciences

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volume 533)

Pages:

432-435

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.533.432

Citation:

Cite this paper

Online since:

February 2014

Authors:

Xi Guo, Jian Yong Wang*

Keywords:

Equivalence Class, Predicate Abstraction, Status Reduction, Test Case Generation

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

* - Corresponding Author

References

[1] Harrold M J, Gupta R, Soffa M L. A methodology for controlling the size of a test suite. ACM Transactions of Software Engineering and Methodology, 1993, 2(3): 270-285.

DOI: 10.1145/152388.152391

Google Scholar

[2] QU W X, LI T, GUO Y, et al. Advances in Predicate Abstraction. Journal of Software, 2008, 19(1): 27-38. (in Chinese).

Google Scholar

[3] Hong H S, Cha S D, Lee I, et al. Data flow testing as model checking. Proc. of the 25th International Conference on Software Engineering (ICSE'03)[C], Portland, 2003, 232-243.

DOI: 10.1109/icse.2003.1201203

Google Scholar

[4] Chvatal V. A greedy heuristic for the set-covering problem. Mathematics of Operations Research, 1979, 4(3): 233-235.

DOI: 10.1287/moor.4.3.233

Google Scholar

[5] Chen T Y, Lau M F. On the completeness of a test suite reduction strategy. The Computer Journal, 1999, 42(5): 430-440.

Google Scholar

[6] Henzinger T A, Jhala R, Majumdar R. Lazy abstraction. ACM Symposium on Principles of Programming Language [C], Oregon, 2002, 58-70.

DOI: 10.1145/503272.503279

Google Scholar

[7] Detlefs D, Nelson G, Saxe J B. Simplify: A theorem prover for program checking. Journal of the ACM, 2005, 52(3): 365-473.

DOI: 10.1145/1066100.1066102

Google Scholar