An approach to automating the verification of compact parallel coordination programs. I (Q1056221)
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: An approach to automating the verification of compact parallel coordination programs. I |
scientific article; zbMATH DE number 3827177
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An approach to automating the verification of compact parallel coordination programs. I |
scientific article; zbMATH DE number 3827177 |
Statements
An approach to automating the verification of compact parallel coordination programs. I (English)
0 references
1984
0 references
shared memory asynchronous parallel processor
0 references
NYU-ultracomputer
0 references
correctness proof
0 references
reachability set description
0 references
meta-states
0 references
compact parallel program
0 references
0 references
