Category Partition Method and Satisfiability Modulo Theories for test case generation

Created by W.Langdon from gp-bibliography.bib Revision:1.7615

@InProceedings{Chimisliu:2012:AST,

• author = "Valentin Chimisliu and Franz Wotawa",
• title = "Category Partition Method and Satisfiability Modulo Theories for test case generation",
• booktitle = "7th International Workshop on Automation of Software Test (AST 2012)",
• year = "2012",
• month = jun,
• address = "Zurich",
• pages = "64--70",
• size = "7 pages",
• abstract = "In this paper we focus on test case generation for large database applications in the telecommunication industry domain. In particular, we present an approach that is based on the Category Partition Method and uses the SMT solver Z3 for automatically generating input test data values for the obtained test cases. For the generation process, we make use of different test case generation strategies. First initial results show that the one based on genetic programming delivers the fewest number of test cases while retaining choice coverage. Moreover, the obtained results indicate that the presented approach is feasible for the intended application domain.",
• keywords = "genetic algorithms, genetic programming, SBSE, SMT solver Z3, automatic test data values generation, category partition method, intended application domain, large database applications, satisfiability modulo theories, telecommunication industry domain, test case generation strategies, automatic test pattern generation, computability, database management systems, telecommunication computing, telecommunication industry",
• DOI = "doi:10.1109/IWAST.2012.6228992",
• notes = "Also known as \cite{6228992}",

}

Genetic Programming entries for Valentin Constantin Chimisliu Franz Wotawa

Citations