Deciding Boolean algebra with Presburger arithmetic (Q861705)

From MaRDI portal
Revision as of 13:18, 25 June 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
Deciding Boolean algebra with Presburger arithmetic
scientific article

    Statements

    title
    Deciding Boolean algebra with Presburger arithmetic (English)
    0 references
    author
    Viktor Kuncak
    0 references
    Huu Hai Nguyen
    0 references
    Martin C. Rinard
    0 references
    publication date
    30 January 2007
    0 references
    Mathematics Subject Classification ID
    03B35
    0 references
    03B25
    0 references
    68P05
    0 references
    68Q60
    0 references
    zbMATH DE Number
    5119739
    0 references
    zbMATH Keywords
    Boolean algebra
    0 references
    Presburger arithmetic
    0 references
    decision procedure
    0 references
    quantifier elimination
    0 references
    complexity
    0 references
    program verification
    0 references
    describes a project that uses
    Isabelle/HOL
    0 references
    HOL
    0 references
    Quaffle
    0 references
    CVC Lite
    0 references
    VAMPIRE
    0 references
    PVS
    0 references
    UCLID
    0 references
    MONA
    0 references
    ML
    0 references
    OpenAlex ID
    W2102913701
    0 references
    cites work
    Q4406531
    0 references
    Q5691140
    0 references
    Q2740887
    0 references
    Alternation
    0 references
    Q5674430
    0 references
    Q5287513
    0 references
    Theory of computation.
    0 references
    Q4813414
    0 references
    Static Analysis
    0 references
    Q2751379
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q861705&oldid=34914946"
    Powered by MediaWiki