Precise Relational Invariants Through Strategy Iteration

DOI10.1007/978-3-540-74915-8_6zbMath1179.68037OpenAlexW1540154185MaRDI QIDQ3608402

Helmut Seidl, Thomas Martin Gawlitza

Publication date: 5 March 2009

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74915-8_6

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (7)

Template-Based Unbounded Time Verification of Affine Hybrid Automata ⋮ Abstract interpretation meets convex optimization ⋮ Tropical linear-fractional programming and parametric mean payoff games ⋮ Improving Strategies via SMT Solving ⋮ Numerical invariants through convex relaxation and max-strategy iteration ⋮ Proving Termination by Policy Iteration ⋮ Static Analysis by Abstract Interpretation: A Mathematical Programming Approach

Uses Software

• Octagon

This page was built for publication: Precise Relational Invariants Through Strategy Iteration