Sciweavers

143 search results - page 1 / 29
» Termination of Well-Typed Logic Programs
Sort
View
PPDP
2001
Springer
13 years 11 months ago
Termination of Well-Typed Logic Programs
Annalisa Bossi, Nicoletta Cocco, Sabina Rossi
SAS
2005
Springer
118views Formal Methods» more  SAS 2005»
14 years 26 days 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 ...
LPAR
2001
Springer
13 years 11 months ago
Inferring Termination Conditions for Logic Programs Using Backwards Analysis
This paper focuses on the inference of modes for which a logic program is guaranteed to terminate. This generalizes traditional termination analysis where an analyzer tries to veri...
Samir Genaim, Michael Codish
CORR
2000
Springer
82views Education» more  CORR 2000»
13 years 7 months ago
On Modular Termination Proofs of General Logic Programs
Annalisa Bossi, Nicoletta Cocco, Sandro Etalle, Sa...