A SAT-Based Approach to Size Change Termination with Global Ranking Functions
From MaRDI portal
Publication:5458329
DOI10.1007/978-3-540-78800-3_16zbMATH Open1134.68398OpenAlexW1578701395MaRDI QIDQ5458329FDOQ5458329
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
Recommendations
Cites Work
- Proving termination with multiset orderings
- The size-change principle for program termination
- Logic programming with satisfiability
- Proving Termination Using Recursive Path Orders and SAT Solving
- Solving Partial Order Constraints for LPO Termination
- Certified Size-Change Termination
- Termination Analysis with Calling Context Graphs
- A semantic basis for the termination analysis of logic programs
- Static Analysis
- A general framework for automatic termination analysis od logic programs
- The size-change principle and dependency pairs for termination of term rewriting
- Rewriting Techniques and Applications
- Programming Languages and Systems
- Size-Change Termination and Bound Analysis
- Logic Programming
- Ranking Functions for Size-Change Termination II
Cited In (8)
- Fast offline partial evaluation of logic programs
- Tuple interpretations for termination of term rewriting
- Size-based termination of higher-order rewriting
- A complexity tradeoff in ranking-function termination proofs
- A Hybrid Approach to Conjunctive Partial Evaluation of Logic Programs
- SAT solving for termination proofs with recursive path orders and dependency pairs
- Ranking Functions for Size-Change Termination II
- Proving Termination with (Boolean) Satisfaction
This page was built for publication: A SAT-Based Approach to Size Change Termination with Global Ranking Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458329)
