Constraint-Based Test Generation
ConceptConstraint-based test generation is a test-program-generation paradigm in which instruction streams, initial states, and expected results are produced by solving or sampling a set of architectural and verification-target constraints. The supplied evidence traces this paradigm from early constraint-satisfaction formulations for processor test programs (Lewin et al., 1995) through its embodiment in the Genesys test-program generator (Aharon et al., DATE 1999) and its continued use in constraint-based specifications and abstract-CSP formulations of instruction-stream generation cited in DATE 2022 cross-level processor-verification work.
WIKI
Overview
Constraint-based test generation is a test-program-generation approach in which the test inputs (instruction streams, initial processor states, and expected results) are produced by solving or sampling a set of constraints that encode architectural legality and verification-target rules. The supplied evidence traces this paradigm from early constraint-satisfaction formulations for processor test programs, through its embodiment in the Genesys test-program generator, and into more recent constraint-based specifications and abstract-CSP formulations of instruction-stream generation.
Foundational work
NEIGHBORHOOD
No graph connections found for this entity yet. It may appear in future ingestion runs.
explore full graph →