Pages that link to "Item:Q4673545"
From MaRDI portal
The following pages link to cTI: a constraint-based termination inference tool for ISO-Prolog (Q4673545):
Displaying 7 items.
- Finite-tree analysis for constraint logic-based languages (Q817224) (← links)
- Loop detection in term rewriting using the eliminating unfoldings (Q944383) (← links)
- Applications of polyhedral computations to the analysis and verification of hardware and software systems (Q1035700) (← links)
- Termination prediction for general logic programs (Q3648357) (← links)
- A New Approach to Non-termination Analysis of Logic Programs (Q4649732) (← links)
- Correctness and Completeness of Logic Programs (Q5277919) (← links)
- Termination Analysis of Logic Programs Based on Dependency Graphs (Q5504590) (← links)
