The following pages link to vZ (Q34457):
Displaying 15 items.
- Optimization modulo non-linear arithmetic via incremental linearization (Q831943) (← links)
- Solving linear optimization over arithmetic constraint formula (Q1675635) (← links)
- Introducing Pareto minimal correction subsets (Q1680256) (← links)
- Scalable optimal deployment in the cloud of component-based applications using optimization modulo theory, mathematical programming and symmetry breaking (Q2043801) (← links)
- Optimization modulo the theories of signed bit-vectors and floating-point numbers (Q2051569) (← links)
- Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints (Q2074672) (← links)
- Adaptive testing for specification coverage and refinement in CPS models (Q2085163) (← links)
- \textsc{OptiMathSAT}: a tool for optimization modulo theories (Q2303246) (← links)
- Speeding up the Constraint-Based Method in Difference Logic (Q2818021) (← links)
- Block-Wise Abstract Interpretation by Combining Abstract Domains with SMT (Q2961574) (← links)
- Practical SMT-based type error localization (Q2981994) (← links)
- Search-Space Partitioning for Parallelizing SMT Solvers (Q3453241) (← links)
- Incomplete SMT Techniques for Solving Non-Linear Formulas over the Integers (Q4972164) (← links)
- MILP, Pseudo-Boolean, and OMT Solvers for Optimal Fault-Tolerant Placements of Relay Nodes in Mission Critical Wireless Networks* (Q5140144) (← links)
- LightDP: towards automating differential privacy proofs (Q5370924) (← links)
