Pages that link to "Item:Q479837"
From MaRDI portal
The following pages link to Deciding floating-point logic with abstract conflict driven clause learning (Q479837):
Displaying 14 items.
- Semantically-guided goal-sensitive reasoning: model representation (Q287333) (← links)
- raSAT: an SMT solver for polynomial constraints (Q1688535) (← links)
- Optimization modulo the theories of signed bit-vectors and floating-point numbers (Q2051569) (← links)
- An SMT theory of fixed-point arithmetic (Q2096435) (← links)
- Correct approximation of IEEE 754 floating-point arithmetic for program verification (Q2152274) (← links)
- A two-phase approach for conditional floating-point verification (Q2233493) (← links)
- \textsc{OptiMathSAT}: a tool for optimization modulo theories (Q2303246) (← links)
- Optimization modulo the theory of floating-point numbers (Q2305439) (← links)
- Abstract interpretation as automated deduction (Q2360874) (← links)
- An approximation framework for solvers and decision procedures (Q2362497) (← links)
- A Survey of Satisfiability Modulo Theory (Q2830018) (← links)
- Abstract Interpretation as Automated Deduction (Q3454115) (← links)
- Rigorous Estimation of Floating-Point Round-off Errors with Symbolic Taylor Expansions (Q5206960) (← links)
- Analysis and Transformation of Constrained Horn Clauses for Program Verification (Q6063893) (← links)
