Show simple item record

dc.contributor.authorLin, Jinkun
dc.contributor.authorLuo, Chuan
dc.contributor.authorCai, Shaowei
dc.contributor.authorSu, Kaile
dc.contributor.authorHao, Dan
dc.contributor.authorZhang, Lu
dc.contributor.editorCohen, M
dc.contributor.editorGrunske, L
dc.contributor.editorWhalen, M
dc.date.accessioned2018-02-21T06:11:22Z
dc.date.available2018-02-21T06:11:22Z
dc.date.issued2015
dc.identifier.isbn9781509000241
dc.identifier.issn1527-1366
dc.identifier.doi10.1109/ASE.2015.61
dc.identifier.urihttp://hdl.handle.net/10072/123677
dc.description.abstractCovering arrays (CAs) are often used as test suites for combinatorial interaction testing to discover interaction faults of real-world systems. Most real-world systems involve constraints, so improving algorithms for covering array generation (CAG) with constraints is beneficial. Two popular methods for constrained CAG are greedy construction and meta-heuristic search. Recently, a meta-heuristic framework called two-mode local search has shown great success in solving classic NPhard problems. We are interested whether this method is also powerful in solving the constrained CAG problem. This work proposes a two-mode meta-heuristic framework for constrained CAG efficiently and presents a new meta-heuristic algorithm called TCA. Experiments show that TCA significantly outperforms state-of-the-art solvers on 3-way constrained CAG. Further experiments demonstrate that TCA also performs much better than its competitors on 2-way constrained CAG.
dc.description.peerreviewedYes
dc.languageEnglish
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)
dc.publisher.placeUnited States of America
dc.relation.ispartofconferencename30th IEEE/ACM International Conference on Automated Software Engineering Workshops (ASEW)
dc.relation.ispartofconferencetitle2015 30TH IEEE/ACM INTERNATIONAL CONFERENCE ON AUTOMATED SOFTWARE ENGINEERING
dc.relation.ispartofdatefrom2015-11-09
dc.relation.ispartofdateto2015-11-13
dc.relation.ispartoflocationLincoln, NE
dc.relation.ispartofpagefrom494
dc.relation.ispartofpageto505
dc.relation.ispartofedition1st
dc.subject.fieldofresearchSoftware engineering not elsewhere classified
dc.subject.fieldofresearchcode461299
dc.titleTCA: An Efficient Two-Mode Meta-Heuristic Algorithm for Combinatorial Test Generation
dc.typeConference output
dc.type.descriptionE1 - Conferences
dc.type.codeE - Conference Publications
gro.hasfulltextNo Full Text
gro.griffith.authorSu, Kaile


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

  • Conference outputs
    Contains papers delivered by Griffith authors at national and international conferences.

Show simple item record