Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving (Q2418047)

From MaRDI portal
Revision as of 22:50, 14 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q127871360, #quickstatements; #temporary_batch_1723667127323)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving
scientific article

    Statements

    Efficient verification of concurrent systems using local-analysis-based approximations and SAT solving (English)
    0 references
    0 references
    0 references
    0 references
    3 June 2019
    0 references
    0 references
    0 references
    0 references
    0 references
    approximate reachability
    0 references
    local analysis
    0 references
    SAT solving
    0 references
    formal verification
    0 references
    deadlock freedom
    0 references
    model checking
    0 references
    approximate verification
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references