Name
Abstract | ||
|---|---|---|
pjbdd is a flexible and modular Java library for binary decision diagrams (BDD), which are a well-known data structure for performing efficient operations on compressed sets and relations. BDDs have practical applications in composing and analyzing boolean functions, e.g., for computer-aided verification. Despite its importance, there are only a few BDD libraries available. pjbdd is based on a slim object-oriented design, supportsmulti-threaded execution of the BDD operations (internal) as well as thread-safe access to the operations from applications (external). Itprovides automatic referencecountingandgarbage collection. The modular design of the library allows us to provide a uniform API for binary decision diagrams, zero-suppressed decision diagrams, and also chained decision diagrams. This paper includes a compact evaluation of pjbdd, to demonstrate that concurrent operations on large BDDs scale well and parallelize nicely on multi-core CPUs. |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1007/978-3-030-88885-5_10 | AUTOMATED TECHNOLOGY FOR VERIFICATION AND ANALYSIS, ATVA 2021 |
Keywords | DocType | Volume |
BDD, Java Library, Concurrency, Multi-threaded Application | Conference | 12971 |
ISSN | Citations | PageRank |
0302-9743 | 0 | 0.34 |
References | Authors | |
0 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dirk Beyer | 1 | 1736 | 100.85 |
| Karlheinz Friedberger | 2 | 17 | 3.33 |
| Stephan Holzner | 3 | 0 | 0.34 |