A scalable parallel algorithm for reachability analysis of very large circuits (Q1871864)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A scalable parallel algorithm for reachability analysis of very large circuits |
scientific article; zbMATH DE number 1903887
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A scalable parallel algorithm for reachability analysis of very large circuits |
scientific article; zbMATH DE number 1903887 |
Statements
A scalable parallel algorithm for reachability analysis of very large circuits (English)
0 references
4 May 2003
0 references
verification
0 references
model checking
0 references
symbolic slicing
0 references
distributed space requirement
0 references
