Skip to content
STIMSMITH

Combinatorial Model-Based Generation

Concept

A test program generation approach for microprocessors that uses formal specifications of an instruction set architecture (ISA) to automatically construct test programs. It expresses test situations, instructions, and inter-instruction dependencies as parameterized templates, and generates programs by combining these elements into finite sequences of instructions.

First seen 6/11/2026
Last seen 6/11/2026
Evidence 1 chunks
Wiki v1

WIKI

Overview

Combinatorial model-based generation is a test program generation technique used in microprocessor verification. It relies on formal specifications of the microprocessor's instruction set architecture (ISA), which describe instructions in terms of their behavior, independent of how they are processed on a pipeline. The approach generates test programs automatically by combining formally described test situations and dependencies into finite sequences of instructions, expressed as parameterized test templates.

Formal Instruction Description

READ FULL ARTICLE →

NEIGHBORHOOD

No graph connections found for this entity yet. It may appear in future ingestion runs.

explore full graph →

RELATIONSHIPS

1 connections
An Approach to Test Programs Generation for Microprocessors Based on Pipeline Hazards Templates ← uses 90% 1e
The paper's approach is based on combinatorial model-based generation.

LINKED ENTITIES

1 links
An Approach to Test Programs Generation for Microprocessors Based on Pipeline Hazards Templates USES Extracted graph relationship

CITATIONS

7 sources
7 citations — click to expand
[1] The approach is based on combinatorial model-based generation and uses formal specifications of microprocessor ISA describing instructions regardless of their pipeline processing. An Approach to Test Programs Generation for Microprocessors Based on Pipeline Hazards Templates
[2] Each instruction is formally described by a mnemonic, list of operands, precondition, latency, and semantics in the imperative form. An Approach to Test Programs Generation for Microprocessors Based on Pipeline Hazards Templates
[3] Test programs are generated automatically by combining test situations and dependencies for finite sequences of instructions. An Approach to Test Programs Generation for Microprocessors Based on Pipeline Hazards Templates
[4] A template defines a testing purpose (situation that should be tested), and the goal of test program generation is to construct a representative set of such templates. An Approach to Test Programs Generation for Microprocessors Based on Pipeline Hazards Templates
[5] Independent operands not governed by a dependency are denoted as '?' in templates. An Approach to Test Programs Generation for Microprocessors Based on Pipeline Hazards Templates
[6] A test program is a sequence of test cases, and each test case is structured as Test = {〈Pre_i, Action_i, Post_i〉}_{i=0,n-1}, where Action_i is a test action and Post_i is a test oracle. An Approach to Test Programs Generation for Microprocessors Based on Pipeline Hazards Templates
[7] Test templates may be parameterized; an example includes parameters $FirstInstruction, $Situation, $ThirdInstruction, and $Dependency. An Approach to Test Programs Generation for Microprocessors Based on Pipeline Hazards Templates