Termination Analyzer
SkillDev toolsProve termination of algorithms and programs using ranking functions and well-founded orderings
Instructions available. Your AI can read the instructions. Execution depends on the setup they require.
Account requirements not reviewed. Check the skill instructions before use; ahel provides instructions and does not run this skill.
Add ahel to your AI once: Claude, ChatGPT, Cursor, Claude Code or Codex. Then ask it to use this.
Then ask your AI: use the Termination Analyzer skill
What this skill tells your AI
The instructions your AI receives, as published by a5c-ai/babysitter in library/specializations/domains/science/computer-science/skills/termination-analyzer/SKILL.md and read by ahel’s review.
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
- Structure Analysis: Identify recursive calls and loop structures
- Ranking Function: Find or construct appropriate ranking function
- Ordering Proof: Prove well-foundedness of the ordering
- Certificate Generation: Generate formal termination proof
- Non-termination Detection: Flag potential infinite loops
Tools/Libraries
- AProVE
- T2
- Ultimate Automizer
- SMT solvers
Signals
- GitHub stars
- 2k
- Forks
- 112
- Last commit
- Sep 2026
Advanced
- Item type
- skill
- Key
termination-analyzer- Source
- github.com/a5c-ai/babysitter