Symbolic termination analysis of solvable loops
From MaRDI portal
Publication:1930157
DOI10.1016/j.jsc.2012.05.005zbMath1253.68224MaRDI QIDQ1930157
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
symbolic computation; quantifier elimination; program verification; termination analysis; polynomial loops; real root bounds
68W30: Symbolic computation and algebraic computation
68Q60: Specification and verification (program logics, model checking, etc.)
Related Items
TERMINATOR, Measuring the constrained reachability in quantum Markov chains, Analyzing ultimate positivity for solvable systems, Automatic complexity analysis of integer programs via triangular weakly non-linear loops, Termination of polynomial loops, Discovering non-terminating inputs for multi-path polynomial programs