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
• An extension of lazy abstraction with interpolation for programs with arrays
• MCMT: A Model Checker Modulo Theories
• Parameterized model checking on the TSO weak memory model
• Combined covers and Beth definability
• Title not available (Why is that?)
• A New Acceleration-Based Combination Framework for Array Properties
• Model completeness, uniform interpolants and superposition calculus. (With applications to verification of data-aware processes)
• Search-Space Partitioning for Parallelizing SMT Solvers
• 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
• Finite reasons for safety
• Verification of Composed Array-Based Systems with Applications to Security-Aware Workflows
• Definability of Accelerated Relations in a Theory of Arrays and Its Applications
• Lazy Abstraction with Interpolants for Arrays
• Property-directed inference of universal invariants or proving their absence
• Backward Reachability of Array-based Systems by SMT solving: Termination and Invariant Synthesis
• Satisfiability Modulo Theories
• Combination of uniform interpolants via Beth definability

This page was built for software: Mcmt