OpenParable
Skip to content
← Back to skills

Termination Analyzer

Testing & Quality
termination-analyzer

Termination 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

View on GitHub ↗
QUICK START

How to use this skill

Bring this guide into your coding agent with a prompt tailored to the tool you use.

  1. Open your project in Codex.
  2. Copy and paste the prompt below.
  3. 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

  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