Mcmt
From MaRDI portal
Software:23847
No author found.
Related Items (26)
Lazy Abstraction with Interpolants for Arrays ⋮ Decision procedures for flat array properties ⋮ Counterexample-Guided Prophecy for Model Checking Modulo the Theory of Arrays ⋮ Search-Space Partitioning for Parallelizing SMT Solvers ⋮ Satisfiability Modulo Theories ⋮ Rewriting modulo SMT and open system analysis ⋮ From model completeness to verification of data aware processes ⋮ A New Acceleration-Based Combination Framework for Array Properties ⋮ Property-directed inference of universal invariants or proving their absence ⋮ Parameterized model checking on the TSO weak memory model ⋮ Symbolic backward reachability with effectively propositional logic. Application to security policy analysis ⋮ SMT-based verification of data-aware processes: a model-theoretic approach ⋮ An extension of lazy abstraction with interpolation for programs with arrays ⋮ MCMT: A Model Checker Modulo Theories ⋮ Unnamed Item ⋮ Higher-order quantifier elimination, counter simulations and fault-tolerant systems ⋮ Generalized rewrite theories, coherence completion, and symbolic methods ⋮ Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis ⋮ Model completeness, uniform interpolants and superposition calculus. (With applications to verification of data-aware processes) ⋮ Model completeness, covers and superposition ⋮ Analysis of a clock synchronization protocol for wireless sensor networks ⋮ Definability of Accelerated Relations in a Theory of Arrays and Its Applications ⋮ Verification of Composed Array-Based Systems with Applications to Security-Aware Workflows ⋮ Combination of uniform interpolants via Beth definability ⋮ Combined covers and Beth definability ⋮ Finite reasons for safety
This page was built for software: Mcmt
