Policy iteration in finite templates domain

DOI10.1016/j.entcs.2015.10.002zbMath1351.68068OpenAlexW2229490248WikidataQ113317770 ScholiaQ113317770MaRDI QIDQ2520672

Assalé Adjé

Publication date: 16 December 2016

Full work available at URL: https://doi.org/10.1016/j.entcs.2015.10.002

zbMATH Keywords

policy iterationabstract interpretationconvex optimisation

Mathematics Subject Classification ID

Convex programming (90C25) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Semidefinite programming relaxations for semialgebraic problems
• Computing the smallest fixed point of order-preserving nonexpansive mappings arising in positive stochastic games and static analysis of programs
• Inf-convolution, sous-additivite, convexite des fonctions numériques
• A generic ellipsoid abstract domain for linear time invariant systems
• Coupling Policy Iteration with Semi-definite Relaxation to Compute Accurate Numerical Invariants in Static Analysis
• Characterizations of Strong Regularity for Variational Inequalities over Polyhedral Convex Sets
• Abstract convexity:examples and applications
• Verification, Model Checking, and Abstract Interpretation
• Computer Aided Verification
• Static Analysis by Policy Iteration on Relational Domains

This page was built for publication: Policy iteration in finite templates domain