Well-structured program equivalence is highly undecidable (Q2946675): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2054812122 / rank | |||
Normal rank | |||
| Property / arXiv ID | |||
| Property / arXiv ID: 1103.1433 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:20, 19 April 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Well-structured program equivalence is highly undecidable |
scientific article |
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
