Pages that link to "Item:Q3453240"
From MaRDI portal
The following pages link to SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving (Q3453240):
Displaying 20 items.
- SMT-RAT (Q25009) (← links)
- Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings (Q1996869) (← links)
- Algorithmic reduction of biological networks with multiple time scales (Q2051597) (← links)
- Cooperating techniques for solving nonlinear real arithmetic in the \texttt{cvc5} SMT solver (system description) (Q2104500) (← links)
- Recent developments in theory and tool support for hybrid systems verification with \textsc{HyPro} (Q2105429) (← links)
- Fully incremental cylindrical algebraic decomposition (Q2307621) (← links)
- Modular strategic SMT solving with \textbf{SMT-RAT} (Q2414693) (← links)
- $$\mathsf {SC}^\mathsf{2} $$ : Satisfiability Checking Meets Symbolic Computation (Q2817292) (← links)
- Efficient Simplification Techniques for Special Real Quantifier Elimination with Applications to the Synthesis of Optimal Numerical Algorithms (Q2830000) (← links)
- A Generalised Branch-and-Bound Approach and Its Application in SAT Modulo Nonlinear Integer Arithmetic (Q2830009) (← links)
- Solving Nonlinear Integer Arithmetic with MCSAT (Q2961575) (← links)
- SpySMAC: Automated Configuration and Performance Analysis of SAT Solvers (Q3453227) (← links)
- SMT-RAT: An Open Source C++ Toolbox for Strategic and Parallel SMT Solving (Q3453240) (← links)
- Satisfiability Checking: Theory and Applications (Q4571125) (← links)
- Levelwise construction of a single cylindrical algebraic cell (Q6149151) (← links)
- Handling polynomial and transcendental functions in SMT via unconstrained optimisation and topological degree test (Q6160909) (← links)
- Verified Quadratic Virtual Substitution for Real Arithmetic (Q6488467) (← links)
- Satisfiability modulo finite fields (Q6535532) (← links)
- Parameter synthesis for Markov models: covering the parameter space (Q6564178) (← links)
- Extending the fundamental theorem of linear programming for strict inequalities (Q6666552) (← links)
