{"docId":737,"paperId":737,"url":"https:\/\/lmcs.episciences.org\/737","doi":"10.2168\/LMCS-10(3:8)2014","journalName":"Logical Methods in Computer Science","issn":"","eissn":"1860-5974","volume":[{"vid":150,"name":"Volume 10, Issue 3"}],"section":[],"repositoryName":"arXiv","repositoryIdentifier":"1302.2762","repositoryVersion":4,"repositoryLink":"https:\/\/arxiv.org\/abs\/1302.2762v4","dateSubmitted":"2012-09-30 00:00:00","dateAccepted":"2015-06-25 11:41:15","datePublished":"2014-08-21 00:00:00","titles":["Deciding Conditional Termination"],"authors":["Iosif, Radu","Konecny, Filip","Bozga, Marius"],"abstracts":["We address the problem of conditional termination, which is that of defining the set of initial configurations from which a given program always terminates. First we define the dual set, of initial configurations from which a non-terminating execution exists, as the greatest fixpoint of the function that maps a set of states into its pre-image with respect to the transition relation. This definition allows to compute the weakest non-termination precondition if at least one of the following holds: (i) the transition relation is deterministic, (ii) the descending Kleene sequence overapproximating the greatest fixpoint converges in finitely many steps, or (iii) the transition relation is well founded. We show that this is the case for two classes of relations, namely octagonal and finite monoid affine relations. Moreover, since the closed forms of these relations can be defined in Presburger arithmetic, we obtain the decidability of the termination problem for such loops.","Comment: 61 pages, 6 figures, 2 tables"],"keywords":["Computer Science - Logic in Computer Science","Computer Science - Formal Languages and Automata Theory"]}