Mcmt

swMATH11911MaRDI QIDQ23847FDOQ23847

Author name not available (Why is that?)

Cited In (26)

• Higher-order quantifier elimination, counter simulations and fault-tolerant systems
• Generalized rewrite theories, coherence completion, and symbolic methods
• Symbolic backward reachability with effectively propositional logic. Application to security policy analysis
• SMT-based verification of data-aware processes: a model-theoretic approach
• Decision procedures for flat array properties
• A new acceleration-based combination framework for array properties
• Search-space partitioning for parallelizing SMT solvers
• An extension of lazy abstraction with interpolation for programs with arrays
• Parameterized model checking on the TSO weak memory model
• Combined covers and Beth definability
• Verification of composed array-based systems with applications to security-aware workflows
• Title not available (Why is that?)
• MCMT: a model checker modulo theories
• Backward reachability of array-based systems by SMT solving: termination and invariant synthesis
• Lazy abstraction with interpolants for arrays
• Definability of accelerated relations in a theory of arrays and its applications
• Satisfiability modulo theories
• Finite reasons for safety. Parameterized verification by finite model finding
• Model completeness, uniform interpolants and superposition calculus. (With applications to verification of data-aware processes)
• Counterexample-Guided Prophecy for Model Checking Modulo the Theory of Arrays
• From model completeness to verification of data aware processes
• Analysis of a clock synchronization protocol for wireless sensor networks
• Rewriting modulo SMT and open system analysis
• Model completeness, covers and superposition
• Property-directed inference of universal invariants or proving their absence
• Combination of uniform interpolants via Beth definability

This page was built for software: Mcmt