Sciweavers

143 search results - page 2 / 29
» Termination of Well-Typed Logic Programs
Sort
View
CORR
2002
Springer
77views Education» more  CORR 2002»
13 years 7 months ago
A Dynamic Approach to Characterizing Termination of General Logic Programs
Yi-Dong Shen, Jia-Huai You, Li-Yan Yuan, Samuel S....
SAS
2001
Springer
116views Formal Methods» more  SAS 2001»
13 years 11 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
TPHOL
2007
IEEE
14 years 1 months ago
Proof Pearl: The Termination Analysis of Terminator
Terminator is a static analysis tool developed by Microsoft Research for proving termination of Windows device drivers written in C. This proof pearl describes a formalization in h...
Joe Hurd
CORR
2010
Springer
140views Education» more  CORR 2010»
13 years 7 months ago
Automated Termination Analysis for Logic Programs with Cut
Termination is an important and well-studied property for logic programs. However, almost all approaches for automated termination analysis focus on definite logic programs, where...
Peter Schneider-Kamp, Jürgen Giesl, Thomas St...