Constraint-Based Local Search for the Automatic Generation of Architectural Tests
This paper considers the automatic generation of architectural tests (ATGP), a fundamental problem in processor validation. ATGPs are complex conditional constraint satisfaction problems which typically feature both hard and soft constraints and very large domains (e.g., all memory addresses). Moreover, the goal is to generate a large number of diverse solutions under tight runtime constraints. To improve solution diversity, this paper proposes a novel approach to ATGPs by modeling them as MaxDiversekSet problems and solving them with constraint-based local search over conditional variables. The paper presents the semantics and implementation of conditional variables in this context and demonstrates the computational benefits of the approach.
Unable to display preview. Download preview PDF.
- 1.Mittal, S., Falkenhainer, B.: Dynamic constraint satisfaction problems. In: Proceedings of the Eighth National Conference on Artificial Intelligence (1990)Google Scholar
- 3.Hebrard, E., Hnich, B., O’Sullivan, B., Walsh, T.: Finding diverse and similar solutions in constraint programming. In: Proceedings of the Twentieth National Conference on Artificial Intelligence (2005)Google Scholar
- 5.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) (2002)Google Scholar
- 7.Sabin, D., Freuder, E.C.: Configuration as composite constraint satisfaction. In: Proceedings of Artificial Intelligence and Manufacturing Research Planning Workshop (1996)Google Scholar