Agent-Skills.md

Agent Skills: Termination Analyzer

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

algorithm-analysisID: a5c-ai/babysitter/termination-analyzer

Repository

a5c-ai/babysitter
a5c-aiLicense: MIT
244

Install this agent skill to your local

pnpm dlx add-skill https://github.com/a5c-ai/babysitter/tree/HEAD/plugins/babysitter/skills/babysit/process/specializations/domains/science/computer-science/skills/termination-analyzer

Skill Files

Browse the full folder contents for termination-analyzer.

Download Skill

Loading file tree…

plugins/babysitter/skills/babysit/process/specializations/domains/science/computer-science/skills/termination-analyzer/SKILL.md

Skill Metadata

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

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