Well-structured program equivalence is highly undecidable (Q2946675)

From MaRDI portal
Revision as of 23:21, 23 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    0 references
    17 September 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    PDL
    0 references
    deterministic propositional dynamic logic
    0 references
    fixset
    0 references
    intersection
    0 references
    program equivalence
    0 references
    undecidability
    0 references