Pages that link to "Item:Q5941755"

The following pages link to A general framework for automatic termination analysis od logic programs (Q5941755):

Displaying 18 items.

• Termination of floating-point computations (Q850498) (← links)
• Mechanizing and improving dependency pairs (Q877836) (← links)
• A complexity tradeoff in ranking-function termination proofs (Q1006896) (← links)
• Termination proofs for logic programs (Q1188722) (← links)
• Parametrized verification diagrams: temporal verification of symmetric parametrized concurrent systems (Q2408742) (← links)
• The size-change principle and dependency pairs for termination of term rewriting (Q2573795) (← links)
• Automatic termination analysis for functional and imperative programs (Thesis, TU Darmstadt) (Q2726244) (← links)
• Automated termination analysis for logic programs with cut (Q3585154) (← links)
• Termination prediction for general logic programs (Q3648357) (← links)
• A methodology for proving termination of logic programs (Q4306397) (← links)
• A semantic basis for the termination analysis of logic programs (Q4719375) (← links)
• (Q4779112) (← links)
• Localized Operational Termination in General Logics (Q5256340) (← links)
• A dynamic approach to characterizing termination of general logic programs (Q5267437) (← links)
• A SAT-Based Approach to Size Change Termination with Global Ranking Functions (Q5458329) (← links)
• Termination Analysis of Logic Programs Based on Dependency Graphs (Q5504590) (← links)
• Program Development in Computational Logic (Q5712541) (← links)
• Logic Based Program Synthesis and Transformation (Q5713935) (← links)