GCSP (Graph-Based Constraint Satisfaction Problem)

Tool

GCSP is a framework for constraint-based test generation that models hardware address translation as a directed acyclic graph in which each node and edge can be associated with variables and constraints. It extends CSP with conditional constraint activation along a graph path, and has been used to verify the memory management units (MMUs) of several industrial microprocessors.

First seen 9/24/2026

Last seen 9/24/2026

Evidence 1 chunks

Wiki v1

WIKI

GCSP (Graph-Based Constraint Satisfaction Problem)

GCSP is a framework for solving constraint satisfaction problems in which the assignment of constraints to variables depends on a path through a directed graph. It was developed to support constraint-based test generation for the complex address translation mechanisms that exist in modern microprocessor memory management units (MMUs).

Motivation

READ FULL ARTICLE →

NEIGHBORHOOD

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

explore full graph →

RELATIONSHIPS

3 connections

CSP ← part of 90% 1e

GCSP problems include a CSP component as part of their formulation.

Conditional CSP uses → 96% 1e

The GCSP solving algorithm is based on Conditional CSP.

MMU verification ← uses 78% 1e

The GCSP-based technology was applied in verifying MMUs.

LINKED ENTITIES

3 links

CSP PART_OF Extracted graph relationship

Conditional CSP USES Extracted graph relationship

MMU verification USES Extracted graph relationship

CITATIONS

4 sources

4 citations — click to collapse

[1] GCSP combines a directed acyclic graph with a CSP, where each variable and constraint of the CSP is linked to a particular node or edge of the graph. Using Graph-Based CSP to Solve the Address Translation Problem (IBM Research, CP 2016)

[2] A solution to a GCSP is a path in the graph such that all constraints defined along this path must be satisfied. Using Graph-Based CSP to Solve the Address Translation Problem (IBM Research, CP 2016)

[3] The algorithm for solving GCSP is based on conditional CSP. Using Graph-Based CSP to Solve the Address Translation Problem (IBM Research, CP 2016)

[4] GCSP was used to verify the memory management units of several industrial microprocessors. Using Graph-Based CSP to Solve the Address Translation Problem (IBM Research, CP 2016)