The following pages link to Thomas Martin Gawlitza (Q435966):
Displaying 15 items.
- Abstract interpretation meets convex optimization (Q435969) (← links)
- Numerical invariants through convex relaxation and max-strategy iteration (Q2248100) (← links)
- Template-Based Unbounded Time Verification of Affine Hybrid Automata (Q2901366) (← links)
- Normalization of Linear Horn Clauses (Q2999324) (← links)
- Improving Strategies via SMT Solving (Q3000582) (← links)
- Join-Lock-Sensitive Forward Reachability Analysis for Concurrent Programs with Dynamic Process Creation (Q3075482) (← links)
- Invariant Generation through Strategy Iteration in Succinctly Represented Control Flow Graphs (Q3166219) (← links)
- Discretizing Affine Hybrid Automata with Uncertainty (Q3172936) (← links)
- Computing Game Values for Crash Games (Q3510795) (← links)
- Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations (Q3521959) (← links)
- Precise Relational Invariants Through Strategy Iteration (Q3608402) (← links)
- Games through Nested Fixpoints (Q3636869) (← links)
- Polynomial Precise Interval Analysis Revisited (Q3644736) (← links)
- Computing Relaxed Abstract Semantics w.r.t. Quadratic Zones Precisely (Q4930733) (← links)
- Precise Fixpoint Computation Through Strategy Iteration (Q5756502) (← links)
