Abstract
Constraint Programming (CP) technology has been extensively used in Random Functional Test Generation during the recent years. However, while the existing CP methodologies are well tuned for traditional combinatorial applications e.g. logistics or scheduling, the problem domain of functional test generation remains largely unexplored by the CP community and many of its domain specific features and challenges are still unaddressed. In this paper we focus on the distinctive features of CP for the random functional test generation domain and show how these features can be addressed using a classical CP engine with custom extensions. We present some modeling and solving problems arising in this context and propose solutions. In particular, we address the way of model building in the problem domain of test generation which we refer to as multi-layer modeling. In this context we introduce constraint patterns of composite variable, implied condition and implied composite variable condition, define their semantics and propose schemes for their CSP modeling. The paper also addresses specific problems arising at the solving stage in the problem domain of random test generation. We propose solutions to these problems by means of custom random search algorithms. This approach is illustrated on the examples of the disjunction constraint and conditional variable instantiation. The latter algorithm addresses the feature of dynamic modeling required in the test generation task. To demonstrate the effectiveness of our approach we present experimental results based on the implementation using ILOG Solver as a CP engine.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bin, E., Emek, R., Shurek, G., Ziv, A.: Using a constraint satisfaction formulation and solution techniques for random test program generation. IBM Systems Journal 41(3), 386–402 (2002)
Gutkovich, B., Moss, A.: CP with Architectural State Lookup for Functional Test Generation. In: 11-th Annual IEEE International Workshop on High Level Design Validation and Test, pp. 111–118 (2006)
ILOG Solver 6.3 Reference Manual (2006)
Gomes, C.: Randomized Backtrack Search. In: Milano, M. (ed.) Constraint and Integer Programming: Toward a Unified Methodology, pp. 233–283. Kluwer, Dordrecht (2003)
Smith, B.M.: Modeling for Constraint Programming. The 1-st Constraint Programming Summer School (2005)
Walsh, T.: Constraint Patterns. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 53–64. Springer, Heidelberg (2003)
IA-32 Intel Architecture Software Developer’s Manual (2005)
Mittal, S., Falkenhainer, B.: Dynamic constraint satisfaction problems. In: Proceedings of 8-th National Conference on Artificial Intelligence, pp. 25–32 (1990)
Gelle, E., Faltings, B.: Solving Mixed and Conditional Constraint Satisfaction Problems. Constraints 8, 107–141 (2003)
Sabin, M., Freuder, E.C., Wallace, R.J.: Greater Efficiency for Conditional Constraint Satisfaction. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 649–663. Springer, Heidelberg (2003)
Geller, F., Veksler, M.: Assumption-Based Pruning in Conditional CSP. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 241–255. Springer, Heidelberg (2005)
Van Hentenryck, P., Saraswat, V., Deville, Y.: Design, Implementation, and Evaluation of the Constraint Language cc(FD). In: Podelski, A. (ed.) Constraint Programming: Basics and Trends. LNCS, vol. 910, pp. 293–316. Springer, Heidelberg (1995)
Lhomme, O.: An Efficient Filtering Algorithm for Disjunction of Constraints. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 904–908. Springer, Heidelberg (2003)
Würtz, J., Müller, T.: Constructive Disjunction Revisited. In: Görz, G., Hölldobler, S. (eds.) KI-96: Advances in Artificial Intelligence. LNCS, vol. 1137, pp. 377–386. Springer, Heidelberg (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Moss, A. (2008). Constraint Patterns and Search Procedures for CP-Based Random Test Generation. In: Yorav, K. (eds) Hardware and Software: Verification and Testing. HVC 2007. Lecture Notes in Computer Science, vol 4899. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77966-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-77966-7_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77964-3
Online ISBN: 978-3-540-77966-7
eBook Packages: Computer ScienceComputer Science (R0)