The following pages link to Computer Aided Verification (Q5716589):
Displaying 30 items.
- Mathematical programming: Turing completeness and applications to software analysis (Q405669) (← links)
- Abstract interpretation meets convex optimization (Q435969) (← links)
- Tropical linear-fractional programming and parametric mean payoff games (Q435971) (← links)
- Acceleration of the abstract fixpoint computation in numerical program analysis (Q435974) (← links)
- Stability and convergence in discrete convex monotone dynamical systems (Q644440) (← links)
- A minimalistic look at widening operators (Q848744) (← links)
- Practical policy iterations. A practical use of policy iterations for static analysis: the quadratic case (Q888469) (← links)
- Approximate fixed points in abstract interpretation (Q1330439) (← 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)
- Program derivation by fixed point computation (Q1823657) (← links)
- Falsification of hybrid systems with symbolic reachability analysis and trajectory splicing (Q2060886) (← links)
- Fast and efficient bit-level precision tuning (Q2145313) (← 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)
- A sums-of-squares extension of policy iterations (Q2406948) (← links)
- Policy iteration in finite templates domain (Q2520672) (← links)
- Abstract fixpoint computations with numerical acceleration methods (Q2814099) (← links)
- Static analysis by abstract interpretation: a mathematical programming approach (Q2814107) (← links)
- Mathematical programming based debugging (Q2861570) (← links)
- Template-Based Unbounded Time Verification of Affine Hybrid Automata (Q2901366) (← links)
- Improving Strategies via SMT Solving (Q3000582) (← links)
- Computing Game Values for Crash Games (Q3510795) (← links)
- Proving Termination by Policy Iteration (Q5170173) (← links)
- Narrowing Operators on Template Abstract Domains (Q5206948) (← links)
- Bounded Fixed-Point Iteration (Q5285983) (← links)
- (Q5446614) (← links)
- A zonotopic framework for functional abstractions (Q5962973) (← links)
- A change-based heuristic for static analysis with policy iteration (Q6536281) (← links)
