Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

96

CORR
2000
Springer

63views Education» more CORR 2000»

Termination analysis of logic programs using acceptability with general term orders

15 years 2 months ago

Termination analysis of logic programs using acceptability with general term orders

Download www.cs.kuleuven.ac.be

Alexander Serebrenik, Danny De Schreye

Real-time Traffic

CORR 2000 | Education |

claim paper

Related Content

» Inferring Termination Conditions for Logic Programs Using Backwards Analysis

» Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs

» A Term Rewriting Approach to the Automated Termination Analysis of Imperative Programs

» Automatic Termination Analysis of Logic Programs

» Modular Termination Proofs of Recursive Java Bytecode Programs by Term Rewriting

» Termination Analysis of Logic Programs Based on Dependency Graphs

» Global and Finite Termination of a TwoPhase Augmented Lagrangian Filter Method for General...

» Automated Synthesis of Induction Axioms for Programs with SecondOrder Recursion

» Termination analysis and call graph construction for higherorder functional programs

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2000
Where	CORR
Authors	Alexander Serebrenik, Danny De Schreye

Comments (0)