Juggrnaut: using graph grammars for abstracting unbounded heap structures (Q746781)

From MaRDI portal
Revision as of 02:56, 10 December 2024 by Import241208061232 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Juggrnaut: using graph grammars for abstracting unbounded heap structures
scientific article

    Statements

    title
    Juggrnaut: using graph grammars for abstracting unbounded heap structures (English)
    0 references
    author
    Jonathan Heinen
    0 references
    Christina Jansen
    0 references
    Joost-Pieter Katoen
    0 references
    Thomas Noll
    0 references
    publication date
    20 October 2015
    0 references
    zbMATH Keywords
    heap abstraction
    0 references
    dynamic data structures
    0 references
    hyperedge replacement grammars
    0 references
    software verification
    0 references
    pointer-manipulating programs
    0 references
    describes a project that uses
    MONA
    0 references
    Smallfoot
    0 references
    Slide
    0 references
    cites work
    Q2729054
    0 references
    S-functions for graphs
    0 references
    Q5707890
    0 references
    Q4540967
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68P05
    0 references
    68N30
    0 references
    68Q42
    0 references
    zbMATH DE Number
    6496668
    0 references
    OpenAlex ID
    W2110895665
    0 references
    Wikidata QID
    Q57800682
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q746781&oldid=38473277"
    Powered by MediaWiki