"Deciding Conditional Termination"@en . "P(ED1.1.00/02.0070), P(GAP103/10/0306), P(GD102/09/H042), P(OC10009), Z(MSM0021630528)" . . "RIV/00216305:26230/12:PU98150!RIV13-GA0-26230___" . . "16"^^ . . "26230" . . . . . "0302-9743" . . "RIV/00216305:26230/12:PU98150" . "Radu, Iosif" . "termination problem, conditional termination problem, difference bounds relations, octagonal relations, finite monoid affine relations"@en . . . "This paper addresses the problem of conditional termination, which is that of defining the set of initial configurations from which a given program terminates. First we define the dual set, of initial configurations, from which a non-terminating execution exists, as the greatest fixpoint of the pre-image of the transition relation. This definition enables the representation of this set, whenever the closed form of the relation of the loop is definable in a logic that has quantifier elimination. This entails the decidability of the termination problem for such loops. Second, we present effective ways to compute the weakest precondition for non-termination for difference bounds and octagonal (non-deterministic) relations, by avoiding complex quantifier eliminations. We also investigate the existence of linear ranking functions for such loops. Finally, we study the class of linear affine relations and give a method of under-approximating the termination precondition for a non-trivial subclass" . "Deciding Conditional Termination" . . . "Bozga, Marius" . "This paper addresses the problem of conditional termination, which is that of defining the set of initial configurations from which a given program terminates. First we define the dual set, of initial configurations, from which a non-terminating execution exists, as the greatest fixpoint of the pre-image of the transition relation. This definition enables the representation of this set, whenever the closed form of the relation of the loop is definable in a logic that has quantifier elimination. This entails the decidability of the termination problem for such loops. Second, we present effective ways to compute the weakest precondition for non-termination for difference bounds and octagonal (non-deterministic) relations, by avoiding complex quantifier eliminations. We also investigate the existence of linear ranking functions for such loops. Finally, we study the class of linear affine relations and give a method of under-approximating the termination precondition for a non-trivial subclass"@en . . "129752" . "Deciding Conditional Termination"@en . "7214" . . . . "Lecture Notes in Computer Science" . . "2012" . . "[4B40A41E802E]" . "Kone\u010Dn\u00FD, Filip" . . "DE - Spolkov\u00E1 republika N\u011Bmecko" . "1"^^ . "3"^^ . . "Deciding Conditional Termination" . . . .