Skip to content
STIMSMITH

Code-based Test Generation for Validation of Functional Processor Descriptions

Paper
First seen 5/31/2026
Last seen 6/5/2026
Evidence 11 chunks

NEIGHBORHOOD

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

explore full graph →

RELATIONSHIPS

50 connections
SystemC mentions → 100% 5e
The paper mentions SystemC as a functional modeling language for microprocessors.
Constraint Logic Programming uses → 100% 4e
The paper bases its work on the paradigm of Constraint Logic Programming.
path coverage criterion uses → 100% 4e
The paper uses path coverage criterion as the test generation strategy.
path enumeration uses → 100% 4e
The paper uses path enumeration to generate one constraint store per path.
IDL mentions → 100% 4e
The paper mentions IDL as the STMicroelectronics proprietary language from which x is derived.
STCS introduces → 100% 4e
The paper introduces the STCS dedicated constraint solver.
control flow vector uses → 100% 4e
The paper uses the control flow vector to enumerate all paths.
Genesys mentions → 100% 4e
The paper mentions Genesys as a typical tool for pseudo-random test generation.
reified constraints uses → 100% 4e
The paper uses reified constraints to handle boolean expressions in assignments.
statement coverage evaluates → 100% 4e
The paper evaluates the generated test suite using statement coverage.
control flow graph uses → 100% 4e
The paper uses control flow graphs to analyze program paths.
mutation testing mentions → 100% 3e
The paper mentions mutation testing as potential future work.
Philippe Codognet authored by → 100% 3e
Philippe Codognet is listed as a co-author of the paper.
Fabrice Baray authored by → 100% 3e
Fabrice Baray is listed as a co-author of the paper.
delayed assignment uses → 100% 3e
The paper handles delayed assignments in the x language during constraint generation.
Henri Michel authored by → 100% 3e
Henri Michel is listed as a co-author of the paper.
STTVC introduces → 100% 3e
The paper introduces the STTVC tool for test vector construction.
Daniel Diaz authored by → 100% 3e
Daniel Diaz is listed as a co-author of the paper.
Verilog mentions → 100% 3e
The paper mentions Verilog as a hardware description language.
VHDL mentions → 100% 3e
The paper mentions VHDL as a hardware description language.
Specman mentions → 100% 3e
The paper mentions Specman from Verisity Inc. as an alternative test generation tool.
symbolic solver uses → 92% 2e
The paper uses a symbolic solver to detect impractical paths
SAT techniques ← compares with 80% 2e
The paper mentions comparison of their constraint solver with SAT techniques as future work.
Hardware Verification mentions → 95% 2e
The paper mentions hardware verification as a key use case for simulation models
x language introduces → 100% 2e
The paper defines and introduces the x language as its input language for functional processor descriptions.
static analysis uses → 100% 2e
The paper uses static analysis to translate the hardware description into constraint stores.
Constraint Solving uses → 100% 2e
The paper uses constraint solving techniques to generate test vectors.
SSA form uses → 90% 2e
The paper uses SSA form concepts for array manipulation in constraint generation.
Constraint Satisfaction Problem uses → 100% 2e
The paper frames test generation as a constraint satisfaction problem.
flexsim technology mentions → 100% 2e
The paper mentions flexsim technology at STMicroelectronics.
code-based test generation uses → 100% 2e
The paper addresses code-based test generation as its core methodology.
constraint solving uses → 100% 2e
The paper uses constraint solving techniques to generate test vectors.
static single assignment form uses → 90% 2e
The paper references SSA form for array manipulation techniques.
Bell numbers uses → 90% 2e
The paper uses Bell numbers to characterize the combinatorial complexity of index relationships.
arc-consistency uses → 90% 2e
The constraint solver uses arc consistency techniques for domain reduction.
bit manipulation constraints uses → 100% 2e
The paper introduces and uses specific bit manipulation constraints in the solver.
pseudo-random test generation mentions → 100% 2e
The paper mentions pseudo-random test generation as a standard approach in hardware verification.
GNU Prolog mentions → 100% 2e
The paper mentions GNU Prolog as an existing solver that was considered but found insufficient.
University of Paris 6 LIP6 authored by → 95% 1e
Author Philippe Codognet is affiliated with University of Paris 6 LIP6
University of Paris 1 authored by → 95% 1e
Author Daniel Diaz is affiliated with University of Paris 1
domain reduction uses → 90% 1e
The paper uses domain reduction techniques in the constraint solver.
tabRead constraint uses → 100% 1e
The paper introduces and uses the tabRead constraint for array reads.
VHDL mentions → 100% 1e
The paper mentions VHDL as a hardware description language.
SystemC mentions → 100% 1e
The paper mentions SystemC as a language for functional processor descriptions.
Bell numbers mentions → 100% 1e
The paper mentions Bell numbers in the context of array index relationship enumeration.
code-based test generation introduces → 100% 1e
The paper presents a code-based test generation approach for microprocessor functional models.
constraint store uses → 100% 1e
The paper generates constraint stores for each path to be used in test vector generation.
alias coverage criterion mentions → 100% 1e
The paper introduces and mentions the alias coverage criterion for array index relationships.
tabWrite constraint uses → 100% 1e
The paper introduces and uses the tabWrite constraint for array writes.
STM7 evaluates → 100% 1e
The paper evaluates the approach on the STM7 micro-controller as a case study.