On verifying that a concurrent program satisfies a nondeterministic specification (Q1123589)
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: Publication:1123589 |
scientific article; zbMATH DE number 4110075
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On verifying that a concurrent program satisfies a nondeterministic specification |
scientific article; zbMATH DE number 4110075 |
Statements
On verifying that a concurrent program satisfies a nondeterministic specification (English)
0 references
1989
0 references
concurrent program
0 references
complete proof system
0 references
nondeterministic \(\omega\)- automaton
0 references
\(\Pi ^ 1_ 2\)-complete
0 references
0.8024712204933167
0 references
0.7686511874198914
0 references
0.7652447819709778
0 references
0.7644591927528381
0 references
