Efficiently solving quantified bit-vector formulas (Q2441770)

From MaRDI portal
Revision as of 13:20, 7 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Efficiently solving quantified bit-vector formulas
scientific article

    Statements

    title
    Efficiently solving quantified bit-vector formulas (English)
    0 references
    author
    Youssef Hamadi
    0 references
    Leonardo de Moura
    0 references
    publication date
    28 March 2014
    0 references
    Mathematics Subject Classification ID
    03B70
    0 references
    68Q60
    0 references
    68T15
    0 references
    68T20
    0 references
    zbMATH DE Number
    6275287
    0 references
    zbMATH Keywords
    theorem proving
    0 references
    satisfiability
    0 references
    SMT
    0 references
    bit-vectors
    0 references
    QBF
    0 references
    describes a project that uses
    z3
    0 references
    CirQit2
    0 references
    QUBE
    0 references
    QuBE++
    0 references
    cvc3
    0 references
    MathSAT
    0 references
    Boolector
    0 references
    SMT-LIB
    0 references
    Quantor
    0 references
    STP
    0 references
    OpenAlex ID
    W3137139687
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2441770&oldid=35379850"
    Powered by MediaWiki