Algorithmic analysis of programs with well quasi-ordered domains. (Q1854355)

From MaRDI portal
Revision as of 04:54, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/iandc/AbdullaCJT00, #quickstatements; #temporary_batch_1731468600454)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Algorithmic analysis of programs with well quasi-ordered domains.
scientific article

    Statements

    title
    Algorithmic analysis of programs with well quasi-ordered domains. (English)
    0 references
    author
    Parosh Aziz Abdulla
    0 references
    Kārlis Čerāns
    0 references
    Bengt Jonsson
    0 references
    Yih-Kuen Tsay
    0 references
    publication date
    14 January 2003
    0 references
    zbMATH Keywords
    decidability
    0 references
    well-structured systems
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68Q45
    0 references
    68Q60
    0 references
    03B25
    0 references
    68Q55
    0 references
    zbMATH DE Number
    1853112
    0 references
    OpenAlex ID
    W2052306562
    0 references
    Wikidata QID
    Q56901005
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1854355&oldid=37896022"
    Powered by MediaWiki