6 papers · 1 filter
Recurrence with affine level mappings is P-time decidable for CLP(R)
Fred Mesnard, Alexander Serebrenik
In this paper we introduce a class of constraint logic programs such that their termination can be proved by using affine level mappings. We show that membership to this class is d…
Fingerprinting Logic Programs
Alexander Serebrenik, Wim Vanhoof
In this work we present work in progress on functionality duplication detection in logic programs. Eliminating duplicated functionality recently became prominent in context of refa…
Proceedings of the 15th Workshop on Logic-based methods in Programming Environments WLPE'05 -- October 5, 2005 -- Sitges (Barcelona), Spain
Alexander Serebrenik, Susana Munoz-Hernandez
This volume contains papers presented at WLPE 2005, 15th International Workshop on Logic-based methods in Programming Environments. The aim of the workshop is to provide an informa…
Inference of termination conditions for numerical loops
Alexander Serebrenik, Danny De Schreye
We present a new approach to termination analysis of numerical computations in logic programs. Traditional approaches fail to analyse them due to non well-foundedness of the intege…
Acceptability with general orderings
Danny De Schreye, Alexander Serebrenik
We present a new approach to termination analysis of logic programs. The essence of the approach is that we make use of general orderings (instead of level mappings), like it is do…
Automatic Termination Analysis of Programs Containing Arithmetic Predicates
Nachum Dershowitz, Naomi Lindenstrauss, Yehoshua Sagiv +1
For logic programs with arithmetic predicates, showing termination is not easy, since the usual order for the integers is not well-founded. A new method, easily incorporated in the…