Abstract
We present a novel method for automatically generating artificialtest data that are particularly suited for testing form-centric software applications with several thousand input fields. The complex validation rules for user input are translated to a constraint satisfaction problem (CSP), which is solved using an off-the-shelf SMT-solver. In order to exert pressure onto the software under test, the generated test data have to incorporate extreme and special values (ESVs) for each field. The SMT-solver is aided by a sophisticated graph-based cluster algorithm and by other heuristic methods in order to reduce the complexity of the CSPs. With further optimizations, the test data generator now routinely generates a complete set of test data records for large form-centric applications within less than two hours. The test data generator described here is operationally being used for automated tests of form-centric Web-applications, within an iterative development process emphasizing very early testing of software applications.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
References
Dost, J., Nägele, R.: “jFunk Overview”, mgm technology partners GmbH (2012)
Howden, W.E.: Methodology for the Generation of Program Test Data. IEEE Transactions on Computers C-24(5), 554–560 (1975)
Edvardsson, J.: Survey on Automatic Test Data Generation. In: Second Conf. on Computer Science and Engineering in Linkoeping (ECSEL), pp. 21–28 (1999)
DeMillo, R.A., Offutt, A.J.: Constraint-based automatic test data generation. IEEE Transactions on Software Engineering 17(9), 900–910 (1991)
Gotlieb, A., Botella, B., et al.: Automatic test data generation using constraint solving techniques. ACM SIGSOFT Software Engineering Notes 23(2), 53–62 (1998)
Hooimeijer, P., Veanes, M.: An Evaluation of Automata Algorithms for String Analysis. Redmond City, Microsoft Research (2010)
Braun, M.: A Solver for a Theory of Strings. Fakultät für Informatik, Technische Universität München (2012)
Møller, A.: “Automaton.” Aarhus, Basic Research in Computer Science (BRICS) (2009)
Brüggemann-Klein, A.: Regular expressions into finite automata. In: Simon, I. (ed.) LATIN 1992. LNCS, vol. 583, pp. 87–98. Springer, Heidelberg (1992)
de Moura, L., Bjørner, N.: Z3: An efficient SMT solver (2012)
Freeman, L.C.: A Set of Measures of Centrality Based on Betweenness. Sociometry 40, 35–41 (1977)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Adorf, HM., Varendorff, M. (2014). Constraint-Based Automated Generation of Test Data. In: Winkler, D., Biffl, S., Bergsmann, J. (eds) Software Quality. Model-Based Approaches for Advanced Software and Systems Engineering. SWQD 2014. Lecture Notes in Business Information Processing, vol 166. Springer, Cham. https://doi.org/10.1007/978-3-319-03602-1_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-03602-1_13
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-03601-4
Online ISBN: 978-3-319-03602-1
eBook Packages: Computer ScienceComputer Science (R0)