Sciweavers

330 search results - page 5 / 66
» On Modular Termination Proofs of General 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
2004
Springer
123views Formal Methods» more  SAS 2004»
14 years 1 months ago
Non-termination Inference for Constraint Logic Programs
Termination has been a subject of intensive research in the logic programming community for the last two decades. Most works deal with proving universal left termination of a given...
Étienne Payet, Frédéric Mesna...
SAS
2001
Springer
116views Formal Methods» more  SAS 2001»
14 years 13 days 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
PLDI
2006
ACM
14 years 2 months ago
Termination proofs for systems code
Program termination is central to the process of ensuring that systems code can always react. We describe a new program termination prover that performs a path-sensitive and conte...
Byron Cook, Andreas Podelski, Andrey Rybalchenko