Proving Termination with (Boolean) Satisfaction

DOI10.1007/978-3-540-78769-3_1MaRDI QIDQ5504589zbMATH OpenOpenAlexFDO

Authors Michael Codish

Publication date 22 January 2009

Published in Logic-Based Program Synthesis and Transformation (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• SAT solving for termination proofs with recursive path orders and dependency pairs
• A SAT-Based Approach to Size Change Termination with Global Ranking Functions
• SAT-based termination analysis using monotonicity constraints over the integers
• SAT Solving for Termination Analysis with Polynomial Interpretations
• SAT Solving for Argument Filterings

Cites work

• A machine program for theorem-proving
• Computer Aided Verification
• Logic programming with satisfiability
• Matrix Interpretations for Proving Termination of Term Rewriting
• On recursive path ordering
• Orderings for term-rewriting systems
• Programming Languages and Systems
• Proving Termination Using Recursive Path Orders and SAT Solving
• SAT Solving for Argument Filterings
• SAT Solving for Termination Analysis with Polynomial Interpretations
• Satisfying KBO Constraints
• Solving Partial Order Constraints for LPO Termination
• Term Rewriting and Applications
• Termination of String Rewriting with Matrix Interpretations
• Termination of rewriting
• Termination of term rewriting using dependency pairs
• The size-change principle for program termination

Cited in

(3)

• A new approach to non-termination analysis of logic programs
• Term Rewriting and Applications
• Proving Termination Using Recursive Path Orders and SAT Solving

Describes a project that uses

Uses Software

• Sat4j
• Tyrolean
• AProVE
• TPDB

This page was built for publication: Proving Termination with (Boolean) Satisfaction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5504589)