Sciweavers

213 search results - page 3 / 43
» Automated Termination Analysis for Logic Programs with Cut
Sort
View
SAS
2005
Springer
118views Formal Methods» more  SAS 2005»
13 years 11 months ago
Inference of Well-Typings for Logic Programs with Application to Termination Analysis
A method is developed to infer a polymorphic well-typing for a logic program. Our motivation is to improve the automation of termination analysis by deriving types from which norms...
Maurice Bruynooghe, John P. Gallagher, Wouter Van ...
LOPSTR
2004
Springer
13 years 11 months ago
On Termination of Binary CLP Programs
Abstract. Termination of binary CLP programs has recently become an important question in the termination analysis community. The reason for this is due to that a number of approac...
Alexander Serebrenik, Frédéric Mesna...
PODS
1991
ACM
131views Database» more  PODS 1991»
13 years 9 months ago
Termination Detection in Logic Programs using Argument Sizes
d Abstract Kirack Sohn and Allen Van Gelder University of California, Santa Cruz Progress on automated termination detection for logic programs is reported. The prospects for han...
Kirack Sohn, Allen Van Gelder
LOPSTR
1997
Springer
13 years 10 months ago
Preserving Termination of Tabled Logic Programs While Unfolding
Michael Leuschel, Bern Martens, Konstantinos F. Sa...
SAS
2001
Springer
116views Formal Methods» more  SAS 2001»
13 years 10 months ago
Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs
We present the implementation of cTI, a system for universal left-termination inference of logic programs, which heavily relies on static analysis techniques. Termination inference...
Frédéric Mesnard, Ulrich Neumerkel