ACM Home Page
Please provide us with feedback. Feedback
Dealing with inheritance in OO evolutionary testing
Full text PdfPdf (728 KB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 11th Annual conference on Genetic and evolutionary computation table of contents
Montreal, Québec, Canada
SESSION: Track 14: search based software engineering table of contents
Pages 1665-1672  
Year of Publication: 2009
ISBN:978-1-60558-325-9
Authors
Javier Ferrer  University of Málaga, Málaga, Spain
Francisco Chicano  University of Málaga, Málaga, Spain
Enrique Alba  University of Málaga, Málaga, Spain
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 18,   Downloads (12 Months): 56,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1569901.1570124
What is a DOI?

ABSTRACT

Most of the software developed in the world follows the object-oriented (OO) paradigm. However, the existing work on evolutionary testing is mainly targeted to procedural languages. All this work can be used with small changes on OO programs, but object orientation introduces new features that are not present in procedural languages. Some important issues are polymorphism and inheritance. In this paper we want to make a contribution to the inheritance field by proposing some approaches that use the information of the class hierarchy for helping test case generators to better guide the search. To the best of our knowledge, no work exists using this information to propose test cases. In this work we define a branch distance for logical expressions containing the instanceof operator in Java programs. In addition to the distance measure, we propose two mutation operators based on the distance. We study the behaviour of the mutation operators on a benchmark set composed of nine OO programs. The results show that the information collected from the class hierarchy helps in the search for test cases.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
3
 
4
 
5
Eugenia Díaz, Raquel Blanco, and Javier Tuya. Tabu search for automated loop coverage in software testing. In Proceedings of the International Conference on Knowledge Engineering and Decision Support (ICKEDS), pages 229--234, Porto, 2006.
 
6
 
7
X. Liu, B. Wang, and H. Liu. Evolutionary search in the context of object oriented programs. In Proceedings of the Sixth Metaheuristics International Conference, Vienna, August 2005.
 
8
 
9
Phil McMinn, David Binkley, and Mark Harman. Testability
 
10
transformation for efficient automated test data search in the presence of nesting. In Proceedings of the Third UK Software Testing Workshop (UKTest 2005), pages 165--182, 2005.
 
11
 
12
13
 
14
15
16
 
17
Joachim Wegener, Andre Baresel, and Harmen Sthamer. Evolutionary test environment for automatic structural testing. Information and Software Technology, 43(14):841--854, December 2001.
18

Collaborative Colleagues:
Javier Ferrer: colleagues
Francisco Chicano: colleagues
Enrique Alba: colleagues