agentsclimarketplace
Sign in

Termination analyzer

Skill a5c-ai/babysitter/library/specializations/domains/science/computer-science/skills/termination-analyzer

Prove termination of algorithms and programs using ranking functions and well-founded orderingsFrom its SKILL.md

Install
npx -y skills add a5c-ai/babysitter --skill termination-analyzer

Assembled from the repository path, not quoted from the project. Check it against their README if it does not work.

SKILL.md

1.5 KB, 170 tokens by cl100k_base, as published. Nobody here has run it

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

What ships with it

Read from the repository

Just SKILL.md. No reference files, no scripts.

Keep looking

Skills are one crate of 326,059. Ordering is by how many stacks a row turns up in, so the top of any crate is what has actually been picked rather than what has the most stars.