Genesys PE
ToolNo evidence was provided for Genesys PE, so no technical description, capabilities, provenance, or relationships can be established.
First seen 5/24/2026
Last seen 5/26/2026
Evidence 9 chunks
Wiki v1
WIKI
Overview
No evidence was provided for Genesys PE. Because the article must be based only on provided evidence, there is insufficient information to describe what the tool is, what it does, how it is used, or how it relates to other entities.
Available evidence
NEIGHBORHOOD
No graph connections found for this entity yet. It may appear in future ingestion runs.
explore full graph →RELATIONSHIPS
31 connectionsGenesys PE is the tool that implements constraint-based random stimuli generation for hardware verification.
Genesys PE uses CSP as its core solution technology for test generation.
Genesys PE uses an ontology for describing the functional model and capturing verification expertise.
Genesys PE is built around a knowledge base containing architectural descriptions and expert knowledge.
The application architecture of the stimuli generator (Genesys PE) is a service-oriented architecture.
Genesys PE uses a reference model to compute expected results for generated tests.
The CSP solver in Genesys PE adapts a maintain-arc-consistency scheme.
Genesys PE applies expert knowledge rules to guide stimuli generation.
Genesys PE is compared to its predecessor Genesys in terms of verification productivity, quality and cost.
Genesys PE was developed as a successor and enhancement of Genesys with AI-based improvements.
Genesys PE's constraint solver is based on the MAC scheme.
Genesys PE takes test templates as input to generate tests.
Functional coverage is measured to validate that Genesys PE provides the same level of coverage as Genesys.
The paper reports on Genesys PE as the main tool for constraint-based random stimuli generation in IBM.
The paper evaluates Genesys PE's improvements over Genesys in verification productivity, quality, processes and costs.
Genesys PE is evaluated based on functional coverage metrics.
X-Gen shows usage and payoff schemes resembling Genesys PE at a similar stage of development.
Genesys PE uses stochastic search when constraint propagation is computationally hard.
Genesys PE uses constraint propagation as the fundamental building block of its MAC solver.
Genesys PE uses a special test template language for writing partially specified verification scenarios.
Genesys PE is a model-based stimuli generator that separates the generic engine from the architecture model.
DeepTrans was developed as a specialized tool for address translation and has become part of Genesys PE.
Genesys PE uses soft constraints to model expert knowledge rules with prioritization.
Genesys PE applies expert knowledge constraints in a hierarchical manner.
Genesys PE extends the MAC algorithm with assumption-based pruning to handle conditional CSPs.
Many problems in Genesys PE are conditional, requiring conditional CSP handling.
Genesys PE uses a DNF masks representation for efficient set operations over large domains.
Genesys PE uses parametric propagators to generalize complex domain-specific constraints.
Genesys PE randomizes decisions in the MAC search to achieve disperse solutions from the same template.
Genesys PE uses production rules that observe the test generation process and insert special transactions.
FP-Gen was developed for floating point verification and has become part of Genesys PE.