Verification of Boolean programs with unbounded thread creation (Q2464944)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5221245
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Verification of Boolean programs with unbounded thread creation |
scientific article; zbMATH DE number 5221245 |
Statements
Verification of Boolean programs with unbounded thread creation (English)
0 references
18 December 2007
0 references
program verification
0 references
model checking
0 references
Boolean programs
0 references
reachability
0 references
0.7837488055229187
0 references
0.769341230392456
0 references
0.7649457454681396
0 references
0.751085638999939
0 references
