Universal invariant checking of parametric systems with quantifier-free SMT reasoning (Q2055851): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Ivy / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Cubicle / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: z3 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: CVC4 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-030-79876-5_8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3182495053 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal Methods in Computer-Aided Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite-state invariant checking with IC3 and predicate abstraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal invariant checking of parametric systems with quantifier-free SMT reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formal specification and verification of dynamic parametrized architectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards SMT Model Checking of Array-Based Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Property-directed inference of universal invariants or proving their absence / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Automatic Proving Approach to Parameterized Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Counterexample-guided prophecy for model checking modulo the theory of arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eager abstraction for symbolic model checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2769579 / rank
 
Normal rank

Latest revision as of 08:49, 27 July 2024

scientific article
Language Label Description Also known as
English
Universal invariant checking of parametric systems with quantifier-free SMT reasoning
scientific article

    Statements

    Universal invariant checking of parametric systems with quantifier-free SMT reasoning (English)
    0 references
    0 references
    0 references
    0 references
    1 December 2021
    0 references
    parametric systems
    0 references
    array-based transitions systems
    0 references
    abstraction-refinement
    0 references
    SMT
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers