DMCA
Constraint-Based Local Search for the Automatic Generation of Architectural Tests (2010)
BibTeX
@MISC{Hentenryck10constraint-basedlocal,
author = {Pascal Van Hentenryck and Carleton Coffrin and Boris Gutkovich},
title = {Constraint-Based Local Search for the Automatic Generation of Architectural Tests},
year = {2010}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This paper considers the automatic generation of architectural tests (ATGP), a fundamental problem in processor validation. AT-GPs 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.
Keyphrases
automatic generation architectural test constraint-based local search conditional variable memory address complex conditional constraint satisfaction problem diverse solution processor validation computational benefit tight runtime constraint large domain large number fundamental problem constraintbased local search maxdiversekset problem novel approach solution diversity soft constraint
