Abstract
A simple linear loop is a simple while loop with linear assignments and linear loop guards. If a simple linear loop has only two program variables, we give a complete algorithm for computing the set of all the inputs on which the loop does not terminate. For the case of more program variables, we show that the non-termination set cannot be described by Tarski formulae in general. © 2012 Springer-Verlag.
Author supplied keywords
Cite
CITATION STYLE
Dai, L., & Xia, B. (2012). Non-termination sets of simple linear loops. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7521 LNCS, pp. 61–73). https://doi.org/10.1007/978-3-642-32943-2_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
