Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1007/978-3-642-28756-5_18 | TACAS'12 Proceedings of the 18th international conference on Tools and Algorithms for the Construction and Analysis of Systems |
Keywords | DocType | Volume |
complex quantifier elimination,dual set,affine relation,initial configuration,termination precondition,conditional termination,linear affine relation,linear ranking function,quantifier elimination,termination problem | Journal | abs/1302.2762 |
ISSN | Citations | PageRank |
0302-9743 | 12 | 0.63 |
References | Authors | |
17 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Marius Bozga | 1 | 2100 | 127.83 |
| Radu Iosif | 2 | 483 | 42.44 |
| Filip Konečný | 3 | 83 | 3.78 |