Portfolio approach for constraint solving

Technique

A constraint-solving strategy that runs multiple solving techniques in parallel to rapidly produce solutions to constraint problems. In the context of constrained random stimuli generation, BDD-based and SAT/SMT-based solvers are combined in a portfolio so that the fastest or most suitable solver delivers a solution.

First seen 9/27/2026

Last seen 9/27/2026

Evidence 1 chunks

Wiki v1

WIKI

Overview

A portfolio approach for constraint solving is a technique in which multiple constraint-solving engines are executed in parallel on the same problem, with the system using whichever solver produces a solution first or is best suited to the current instance. The goal is to reduce solution generation time and to combine the complementary strengths of different underlying algorithms.

Application in constrained random stimuli generation

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

CRAVE ← uses 95% 1e

CRAVE employs a portfolio of techniques to speed up constraint solution generation, indicating use of a portfolio approach.

LINKED ENTITIES

1 links

CRAVE USES Extracted graph relationship

CITATIONS

4 sources

4 citations — click to collapse

[1] A portfolio approach is used to enable very fast generation of constraint solutions by combining parallel solvers. CRAVE — Institute for Computer Systems, JKU

[2] BDD-based and SAT/SMT-based techniques have been integrated for constraint-solving. CRAVE — Institute for Computer Systems, JKU

[3] CRAVE is a library for constrained random stimuli generation whose syntax is designed to fit naturally with C++ and SystemC. CRAVE — Institute for Computer Systems, JKU

[4] CRAVE has been contributed to the Accellera Systems Initiative and is further developed by the Verification Working Group (VWG). CRAVE — Institute for Computer Systems, JKU