OpenSMT

From MaRDI portal
Software:20435



swMATH8426MaRDI QIDQ20435


No author found.





Related Items (26)

Quantifier-Free Interpolation of a Theory of ArraysChallenging SMT solvers to verify neural networksA Combination of Rewriting and Constraint Solving for the Quantifier-Free Interpolation of Arrays with Integer Difference ConstraintsSMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT SolvingSearch-Space Partitioning for Parallelizing SMT SolversSatisfiability Modulo Theoriesδ-Complete Decision Procedures for Satisfiability over the RealsSimulating circuit-level simplifications on CNFeVolCheck: Incremental Upgrade Checker for CAutomating Theorem Proving with SMTAn SMT-based approach to weak controllability for disjunctive temporal problems with uncertaintyPropagation based local search for bit-precise reasoningReasoning about algebraic data types with abstractionsFairness modulo theory: a new approach to LTL software model checkingAn interpolating sequent calculus for quantifier-free Presburger arithmeticResolution proof transformation for compression and interpolationAn extension of lazy abstraction with interpolation for programs with arraysI-RiSC: An SMT-Compliant Solver for the Existential Fragment of Real AlgebraImproved Single Pass Algorithms for Resolution Proof ReductiondReal: An SMT Solver for Nonlinear Theories over the RealsInterpolating Quantifier-Free Presburger ArithmeticIntegration of an LP Solver into Interval Constraint PropagationOpenSMT2: An SMT Solver for Multi-core and Cloud ComputingBuilding Bridges between Symbolic Computation and Satisfiability CheckingSolving strong controllability of temporal problems with uncertainty using SMTRewriting-based Quantifier-free Interpolation for a Theory of Arrays.


This page was built for software: OpenSMT