SMTInterpol
From MaRDI portal
Cited in
(53)- iRankFinder
- SDSAT
- Paradox
- WALA
- Cutting the mix
- Fairness modulo theory: a new approach to LTL software model checking
- Algorithm and tools for constructing canonical forms of linear semi-algebraic formulas
- 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
- Ultimate Automizer
- CPAchecker
- CLSAT
- 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
- Verification by gambling on program slices
- MathSAT5
- UFO
- Petrify
- SLAB
- Efficient strategies for CEGAR-based model checking
- Analyzing program termination and complexity automatically with \textsf{AProVE}
- FOCI
- Reducing crash recoverability to reachability
- Proof tree preserving tree interpolation
- Eleven82
- SQCK
- EXPLODE
- Weakly equivalent arrays
- Jimple
- Satisfiability modulo theories
- APT
- Ultimate
- LTLAutomizer
- Ultimate Kojak
- FuncTion
- FlowDroid
- Skink
- Ultimate Taipan
- Satisfiability checking: theory and applications
- SMT-Solvers in Action: Encoding and Solving Selected Problems in NP and EXPTIME
- scientific article; zbMATH DE number 7444022 (Why is no real title available?)
- Articulations and Products of Transition Systems and their Applications to Petri Net Synthesis
- SMT-based model checking for recursive programs
- Loop Invariants from Counterexamples
- GenMul
- multgen
- CCAnr
- CertiStr
- AXDInterpolator
- BoSy
- Leveraging compiler intermediate representation for multi- and cross-language verification
This page was built for software: SMTInterpol
