Pages that link to "Item:Q435969"
From MaRDI portal
The following pages link to Abstract interpretation meets convex optimization (Q435969):
Displaying 11 items.
- Acceleration of the abstract fixpoint computation in numerical program analysis (Q435974) (← links)
- Automatic synthesis of \(k\)-inductive piecewise quadratic invariants for switched affine control programs (Q681342) (← links)
- Practical policy iterations. A practical use of policy iterations for static analysis: the quadratic case (Q888469) (← links)
- Improving the results of program analysis by abstract interpretation beyond the decreasing sequence (Q1620957) (← links)
- Descending chains and narrowing on template abstract domains (Q1671249) (← links)
- Numerical invariants through convex relaxation and max-strategy iteration (Q2248100) (← links)
- Computing the smallest fixed point of order-preserving nonexpansive mappings arising in positive stochastic games and static analysis of programs (Q2260413) (← links)
- Template polyhedra and bilinear optimization (Q2322312) (← links)
- Abstract fixpoint computations with numerical acceleration methods (Q2814099) (← links)
- Coupling policy iteration with semi-definite relaxation to compute accurate numerical invariants in static analysis (Q2881067) (← links)
- (Q5441666) (← links)
