Constraint-based local search for the automatic generation of architectural tests

Authors:
Pascal Van Hentenryck;Carleton Coffrin;Boris Gutkovich
Affiliations:
Brown University, Providence, RI;Brown University, Providence, RI;Intel Corporation, Haifa, Israel
Venue:
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Year:
2009

Citing 6
Cited 4

Tabu Search

Tabu Search
Constraint-Based Local Search

Constraint-Based Local Search
Finding diverse and similar solutions in constraint programming

AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Using a constraint satisfaction formulation and solution techniques for random test program generation

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

HVC'07 Proceedings of the 3rd international Haifa verification conference on Hardware and software: verification and testing
Differentiable invariants

CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming

Value-ordering heuristics: search performance vs. solution diversity

CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Functional test generation with distribution constraints

HVC'09 Proceedings of the 5th international Haifa verification conference on Hardware and software: verification and testing
Kangaroo: an efficient constraint-based local search system using lazy propagation

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Soft constraints of difference and equality

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.