Computing Quadratic Invariants with Min- and Max-Policy Iterations: A Practical Comparison
- 1 January 2014
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 563-578
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Abstract interpretation meets convex optimizationJournal of Symbolic Computation, 2012
- Computing Relaxed Abstract Semantics w.r.t. Quadratic Zones PreciselyLecture Notes in Computer Science, 2010
- Coupling Policy Iteration with Semi-definite Relaxation to Compute Accurate Numerical Invariants in Static Analysis2010
- Precise Relational Invariants Through Strategy Iteration2007
- Precise Fixpoint Computation Through Strategy Iteration2007
- Static Analysis by Policy Iteration on Relational DomainsLecture Notes in Computer Science, 2007
- A Policy Iteration Algorithm for Computing Fixed Points in Static Analysis of Programs2005
- Static Analysis of Digital Filters2004
- Linear Matrix Inequalities in System and Control Theory1994
- Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints1977