Symbolic termination analysis of solvable loops

DOI10.1016/j.jsc.2012.05.005zbMath1253.68224OpenAlexW2076660824MaRDI QIDQ1930157

Ming Xu, Zhi-Bin Li

Publication date: 10 January 2013

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2012.05.005

zbMATH Keywords

symbolic computationquantifier eliminationprogram verificationtermination analysispolynomial loopsreal root bounds

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (6)

Measuring the constrained reachability in quantum Markov chains ⋮ Analyzing ultimate positivity for solvable systems ⋮ Termination of polynomial loops ⋮ TERMINATOR ⋮ Discovering non-terminating inputs for multi-path polynomial programs ⋮ Automatic complexity analysis of integer programs via triangular weakly non-linear loops

This page was built for publication: Symbolic termination analysis of solvable loops