Termination Analyzer
Testing & Qualitytermination-analyzerTermination Analyzer is an Agent Skill for testing & quality published in the a5c-ai/babysitter repository on GitHub: a SKILL.md instruction file an AI agent can load to do this task.
Prove termination of algorithms and programs using ranking functions and well-founded orderings
QUICK START
How to use this skill
Bring this guide into your coding agent with a prompt tailored to the tool you use.
- Open your project in Codex.
- Copy and paste the prompt below.
- Review files and risks before approving any action.
Prompt to paste
Inspect the Agent Skill at https://github.com/a5c-ai/babysitter/blob/HEAD/library/specializations/domains/science/computer-science/skills/termination-analyzer/SKILL.md and all supporting files. Report provenance, permissions, scripts, dependencies, and security risks. Propose an exact installation into .agents/skills/termination-analyzer, but wait for my approval before writing files or running scripts.
Copying this prompt does not install or run the skill. Review third-party files before use.
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
- 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