termination-analyzer

Solid

Prove termination of algorithms and programs using ranking functions and well-founded orderings

AI & Automation 1,160 stars 71 forks Updated today MIT

Install

View on GitHub

Quality Score: 94/100

Stars 20%

100

Recency 20%

100

Frontmatter 20%

Documentation 15%

Issue Health 10%

License 10%

100

Description 5%

100

Skill Content

# Termination Analyzer ## Purpose Provides expert guidance on proving termination of algorithms through ranking functions, well-founded orderings, and automated analysis. ## Capabilities - Identify ranking/variant functions automatically - Prove well-founded orderings - Handle mutual recursion - Detect potential non-termination - Generate termination certificates - Analyze complex control flow ## Usage Guidelines 1. **Structure Analysis**: Identify recursive calls and loop structures 2. **Ranking Function**: Find or construct appropriate ranking function 3. **Ordering Proof**: Prove well-foundedness of the ordering 4. **Certificate Generation**: Generate formal termination proof 5. **Non-termination Detection**: Flag potential infinite loops ## Tools/Libraries - AProVE - T2 - Ultimate Automizer - SMT solvers