Constraint patterns and search procedures for CP-based random test generation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4899 LNCS, Issue , 2008, Pages 86-103

  Moss, Anna ^a  

^a INTEL CORPORATION   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING; CONSTRAINT THEORY; FUNCTIONAL PROGRAMMING; INFORMATION THEORY; LEARNING ALGORITHMS; RANDOM PROCESSES; SOFTWARE TESTING; VERIFICATION;

CONSTRAINT PROGRAMMING; DISTINCTIVE FEATURES; DOMAIN-SPECIFIC; DYNAMIC MODELLING; FUNCTIONAL TEST GENERATION; HARDWARE AND SOFTWARE; MULTI LAYERING; PROBLEM DOMAINS; RANDOM SEARCH ALGORITHMS; SEARCH PROCEDURES; SPECIFIC PROBLEMS; TEST GENERATIONS; VARIABLE CONDITIONS;

TESTING;

EID: 49949108404     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-77966-7_10     Document Type: Conference Paper

References (14)

1. 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)
2. 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, 111-118 (2006)
3. ILOG Solver 6.3 Reference Manual (2006)
4. Gomes, C.: Randomized Backtrack Search. In: Milano, M. (ed.) Constraint and Integer Programming: Toward a Unified Methodology, pp. 233-283. Kluwer, Dordrecht (2003)
5. Smith, B.M.: Modeling for Constraint Programming. The 1-st Constraint Programming Summer School (2005)
6. Walsh, T.: Constraint Patterns. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 53-64. Springer, Heidelberg (2003)
7. IA-32 Intel Architecture Software Developer's Manual (2005)
8. Mittal, S., Falkenhainer, B.: Dynamic constraint satisfaction problems. In: Proceedings of 8-th National Conference on Artificial Intelligence, pp. 25-32 (1990)
9. Gelle, E., Faltings, B.: Solving Mixed and Conditional Constraint Satisfaction Problems. Constraints 8, 107-141 (2003)
10. 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)
11. 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)
12. 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)
13. 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)
14. 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)