Well-structured program equivalence is highly undecidable (Q2946675)
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 6483180
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Well-structured program equivalence is highly undecidable |
scientific article; zbMATH DE number 6483180 |
Statements
Well-structured program equivalence is highly undecidable (English)
0 references
17 September 2015
0 references
PDL
0 references
deterministic propositional dynamic logic
0 references
fixset
0 references
intersection
0 references
program equivalence
0 references
undecidability
0 references
0.7889081835746765
0 references
0.7748921513557434
0 references
0.7741515040397644
0 references
0.768973708152771
0 references
0.7512338757514954
0 references
