SMT-based model checking for recursive programs (Q518396)

From MaRDI portal
Revision as of 20:08, 9 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
SMT-based model checking for recursive programs
scientific article

    Statements

    title
    SMT-based model checking for recursive programs (English)
    0 references
    author
    Anvesh Komuravelli
    0 references
    Arie Gurfinkel
    0 references
    Sagar Chaki
    0 references
    publication date
    28 March 2017
    0 references
    zbMATH Keywords
    model checking
    0 references
    may-must
    0 references
    satisfiability
    0 references
    quantifier elimination
    0 references
    recursion
    0 references
    compositional
    0 references
    describes a project that uses
    Ultimate Automizer
    0 references
    SMTInterpol
    0 references
    Boogie
    0 references
    SPIN
    0 references
    Bebop
    0 references
    CBMC
    0 references
    z3
    0 references
    Spacer
    0 references
    UFO
    0 references

    Identifiers

    zbMATH DE Number
    6697746
    0 references
    OpenAlex ID
    W2571456046
    0 references
    arXiv ID
    1405.4028
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q518396&oldid=38384626"
    Powered by MediaWiki