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