Horn clause verification with convex polyhedral abstraction and tree automata-based refinement (Q681335)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Horn clause verification with convex polyhedral abstraction and tree automata-based refinement
scientific article

    Statements

    Horn clause verification with convex polyhedral abstraction and tree automata-based refinement (English)
    0 references
    0 references
    0 references
    30 January 2018
    0 references
    Horn clauses
    0 references
    abstract interpretation
    0 references
    finite tree automata
    0 references
    tree automata determinisation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers