An efficient SMT solver for string constraints (Q518402)

From MaRDI portal
Revision as of 13:57, 13 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
An efficient SMT solver for string constraints
scientific article

    Statements

    title
    An efficient SMT solver for string constraints (English)
    0 references
    author
    Tianyi Liang
    0 references
    Andrew Reynolds
    0 references
    Nestan Tsiskaridze
    0 references
    Cesare Tinelli
    0 references
    Clark Barrett
    0 references
    Morgan Deters
    0 references
    publication date
    28 March 2017
    0 references
    zbMATH Keywords
    string solving
    0 references
    satisfiability modulo theories
    0 references
    automated deduction
    0 references
    describes a project that uses
    Pex
    0 references
    StarExec
    0 references
    Stranger
    0 references
    PASS
    0 references
    HAMPI
    0 references
    z3
    0 references
    JST
    0 references
    Z3-str
    0 references
    S3
    0 references
    CVC4
    0 references
    Kaluza
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68T15
    0 references
    68Q45
    0 references
    68Q60
    0 references
    zbMATH DE Number
    6697747
    0 references
    OpenAlex ID
    W2330747214
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q518402&oldid=36312427"
    Powered by MediaWiki