330 search results - page 3 / 66 » On Modular Termination Proofs of General Logic Programs |
PPDP
2007
Springer
14 years 2 months ago
2007
Springer
We give a novel transformation for proving termination of higher-order rewrite systems in the format of Inductive Data Type Systems (IDTSs) by Blanqui, Jouannaud and Okada. The tr...
LPAR
2001
Springer
14 years 14 days ago
2001
Springer
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...
PEPM
2010
ACM
13 years 10 months ago
2010
ACM
Software engineering, automated reasoning, rule-based programming or specifications often use rewriting systems for which termination, among other properties, may have to be ensur...
CSL
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
PLDI
2009
ACM
14 years 2 months ago
2009
ACM
We present the first machine-checked correctness proof for information flow control (IFC) based on program dependence graphs (PDGs). IFC based on slicing and PDGs is flow-sensi...