A SAT-Based Approach to Size Change Termination with Global Ranking Functions

DOI10.1007/978-3-540-78800-3_16zbMath1134.68398OpenAlexW1578701395MaRDI QIDQ5458329

Michael Codish, Amir M. Ben-Amram

Publication date: 11 April 2008

Published in: Tools and Algorithms for the Construction and Analysis of Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78800-3_16

Mathematics Subject Classification ID

Related Items (6)

SAT solving for termination proofs with recursive path orders and dependency pairs ⋮ Size-based termination of higher-order rewriting ⋮ Fast offline partial evaluation of logic programs ⋮ A Hybrid Approach to Conjunctive Partial Evaluation of Logic Programs ⋮ A complexity tradeoff in ranking-function termination proofs ⋮ Tuple interpretations for termination of term rewriting

Cites Work

• The size-change principle and dependency pairs for termination of term rewriting
• Size-Change Termination and Bound Analysis
• Proving Termination Using Recursive Path Orders and SAT Solving
• Solving Partial Order Constraints for LPO Termination
• Certified Size-Change Termination
• Ranking Functions for Size-Change Termination II
• Proving termination with multiset orderings
• A semantic basis for the termination analysis of logic programs
• The size-change principle for program termination
• Logic programming with satisfiability
• Logic Programming
• Programming Languages and Systems
• Termination Analysis with Calling Context Graphs
• Static Analysis
• Rewriting Techniques and Applications
• A general framework for automatic termination analysis od logic programs

This page was built for publication: A SAT-Based Approach to Size Change Termination with Global Ranking Functions