Anzeige
Erschienen in:
2009 | OriginalPaper | Buchkapitel
Size-Change Termination, Monotonicity Constraints and Ranking Functions
verfasst von : Amir M. Ben-Amram
Erschienen in: Computer Aided Verification
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Size-change termination involves deducing program termination based on the impossibility of infinite descent. To this end we may use a program abstraction in which transitions are described by
monotonicity constraints
over (abstract) variables. When only constraints of the form
x
>
y
′ and
x
≥
y
′ are allowed, we have size-change graphs, for which both theory and practice are now more evolved then for general monotonicity constraints. This work shows that it is possible to transfer some theory from the domain of size-change graphs to the general case, complementing and extending previous work on monotonicity constraints. Significantly, we provide a procedure to construct explicit global ranking functions from monotonicity constraints in singly-exponential time, which is better than what has been published so far even for size-change graphs. We also consider the integer domain, where general monotonicity constraints are essential because the domain is not well-founded.