All-Path Reachability Logic (Q5170834)

From MaRDI portal
Revision as of 10:22, 6 May 2024 by EloiFerrer (talk | contribs) (‎Merged Item from Q5376656)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7056229
Language Label Description Also known as
English
All-Path Reachability Logic
scientific article; zbMATH DE number 7056229

    Statements

    title
    All-Path Reachability Logic (English)
    0 references
    zbMATH Open document ID
    1416.68052
    0 references
    1421.68015
    0 references
    author
    Andrei Ştefănescu
    0 references
    Ştefan Ciobâcă
    0 references
    Radu Mereuta
    0 references
    Brandon Moore
    0 references
    Grigore Roşu
    0 references
    publication date
    24 July 2014
    0 references
    17 May 2019
    0 references
    Mathematics Subject Classification ID
    68N30
    0 references
    03B70
    0 references
    68N19
    0 references
    68Q55
    0 references
    68T15
    0 references
    zbMATH DE Number
    6320459
    0 references
    7056229
    0 references
    describes a project that uses
    K Prover
    0 references
    Coq
    0 references
    z3
    0 references
    Toolchain
    0 references
    PLT Redex
    0 references
    K tool
    0 references
    OpenAlex ID
    W2259551671
    0 references
    arXiv ID
    1810.10826
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5170834&oldid=34073826"
    Powered by MediaWiki