SMTInterpol
From MaRDI portal
Software:19438
No author found.
Related Items (23)
Analyzing program termination and complexity automatically with \textsf{AProVE} ⋮ Proof tree preserving tree interpolation ⋮ Satisfiability Modulo Theories ⋮ Automatic discovery of fair paths in infinite-state transition systems ⋮ Verification by gambling on program slices ⋮ Satisfiability Checking: Theory and Applications ⋮ Weakly Equivalent Arrays ⋮ Cutting the mix ⋮ Fairness modulo theory: a new approach to LTL software model checking ⋮ Efficient strategies for CEGAR-based model checking ⋮ Unnamed Item ⋮ SMT-Solvers in Action: Encoding and Solving Selected Problems in NP and EXPTIME ⋮ Algorithm and tools for constructing canonical forms of linear semi-algebraic formulas ⋮ SMT-based model checking for recursive programs ⋮ Bounded choice-free Petri net synthesis: algorithmic issues ⋮ A reduction from unbounded linear mixed arithmetic problems into bounded problems ⋮ Efficient interpolation for the theory of arrays ⋮ Reducing crash recoverability to reachability ⋮ Loop Invariants from Counterexamples ⋮ Leveraging compiler intermediate representation for multi- and cross-language verification ⋮ Flexible proof production in an industrial-strength SMT solver ⋮ \textsc{LTL} falsification in infinite-state systems ⋮ Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis
This page was built for software: SMTInterpol
