Pages that link to "Item:Q2946588"
From MaRDI portal
The following pages link to Automated termination proofs for logic programs by term rewriting (Q2946588):
Displaying 25 items.
- Termination proofs for logic programs (Q1188722) (← links)
- Determinization of inverted grammar programs via context-free expressions (Q1979968) (← links)
- Transforming orthogonal inductive definition sets into confluent term rewrite systems (Q2141298) (← links)
- Analyzing program termination and complexity automatically with \textsf{AProVE} (Q2362493) (← links)
- Conversion to tail recursion in term rewriting (Q2436518) (← links)
- Terminating Evaluation of Logic Programs with Finite Three-Valued Models (Q2946744) (← links)
- Dependency Triples for Improving Termination Analysis of Logic Programs with Cut (Q3003493) (← links)
- Termination Graphs for Java Bytecode (Q3058449) (← links)
- Decision Procedures for Automating Termination Proofs (Q3075496) (← links)
- CoLoR: a Coq library on well-founded rewrite relations and its application to the automated verification of termination certificates (Q3094178) (← links)
- Automated termination analysis for logic programs with cut (Q3585154) (← links)
- A Transformational Approach to Polyvariant BTA of Higher-Order Functional Programs (Q3617429) (← links)
- Proving Termination of Integer Term Rewriting (Q3636817) (← links)
- Transformational methodology for proving termination of logic programs (Q3841095) (← links)
- (Q4023458) (← links)
- (Q4386947) (← links)
- Checking termination of bottom-up evaluation of logic programs with function symbols (Q4593017) (← links)
- Using linear constraints for logic program termination analysis (Q4593032) (← links)
- Automated modular termination proofs for real Prolog programs (Q5030196) (← links)
- Automatic termination proofs with transformation orderings (Q5055814) (← links)
- A Transformational Approach to Prove Outermost Termination Automatically (Q5170158) (← links)
- Termination Analysis by Dependency Pairs and Inductive Theorem Proving (Q5191111) (← links)
- Correctness and Completeness of Logic Programs (Q5277919) (← links)
- Termination proofs of well-moded logic programs via conditional rewrite systems (Q5881206) (← links)
- Rewriting Techniques and Applications (Q5901568) (← links)
