Detail publikace

Deciding Conditional Termination

KONEČNÝ, F. IOSIF, R. BOZGA, M.

Originální název

Deciding Conditional Termination

Typ

článek v časopise - ostatní, Jost

Jazyk

angličtina

Originální abstrakt

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 of affine relations.We have performed preliminary experiments on transition systems modeling real-life systems, and have obtained encouraging results.

Klíčová slova

termination problem, conditional termination problem, difference bounds relations, octagonal relations, finite monoid affine relations

Autoři

KONEČNÝ, F.; IOSIF, R.; BOZGA, M.

Rok RIV

2012

Vydáno

1. 4. 2012

ISSN

0302-9743

Periodikum

Lecture Notes in Computer Science

Ročník

2012

Číslo

7214

Stát

Spolková republika Německo

Strany od

252

Strany do

266

Strany počet

16

BibTex

@article{BUT91442,
  author="Filip {Konečný} and Iosif {Radu} and Marius {Bozga}",
  title="Deciding Conditional Termination",
  journal="Lecture Notes in Computer Science",
  year="2012",
  volume="2012",
  number="7214",
  pages="252--266",
  issn="0302-9743"
}