termination-analyzer
Prove termination of algorithms and programs using ranking functions and well-founded orderings
Best use case
termination-analyzer is best used when you need a repeatable AI agent workflow instead of a one-off prompt.
Prove termination of algorithms and programs using ranking functions and well-founded orderings
Teams using termination-analyzer should expect a more consistent output, faster repeated execution, less prompt rewriting.
When to use this skill
- You want a reusable workflow that can be run more than once with consistent structure.
When not to use this skill
- You only need a quick one-off answer and do not need a reusable workflow.
- You cannot install or maintain the underlying files, dependencies, or repository context.
Installation
Claude Code / Cursor / Codex
Manual Installation
- Download SKILL.md from GitHub
- Place it in
.claude/skills/termination-analyzer/SKILL.mdinside your project - Restart your AI agent — it will auto-discover the skill
How termination-analyzer Compares
| Feature / Agent | termination-analyzer | Standard Approach |
|---|---|---|
| Platform Support | Not specified | Limited / Varies |
| Context Awareness | High | Baseline |
| Installation Complexity | Unknown | N/A |
Frequently Asked Questions
What does this skill do?
Prove termination of algorithms and programs using ranking functions and well-founded orderings
Where can I find the source code?
You can find the source code on GitHub using the link provided at the top of the page.
SKILL.md Source
# 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
Related Skills
terraform-analyzer
Specialized skill for analyzing Terraform configurations. Supports parsing, security scanning (tfsec, checkov), cost estimation (infracost), drift detection, and plan visualization across AWS, Azure, and GCP.
db-query-analyzer
Analyze database query performance with execution plans and index recommendations
code-complexity-analyzer
Analyze code complexity metrics including cyclomatic complexity, code smells, and technical debt
cloudformation-analyzer
Validate and analyze AWS CloudFormation templates for security and best practices
semantic-code-analyzer
LLM-powered semantic analysis of code diffs to detect business-logic trojans
sast-analyzer
Static Application Security Testing orchestration and analysis. Execute Semgrep, Bandit, ESLint security plugins, CodeQL, and other SAST tools. Parse, prioritize, and deduplicate findings across multiple tools with remediation guidance.
crypto-analyzer
Cryptographic implementation analysis and validation for encryption algorithms, key sizes, and certificate management
semver-analyzer
Analyze code changes and determine semantic version bumps. Detect breaking changes automatically, suggest version bump (major/minor/patch), generate changelog entries, and validate version consistency.
api-diff-analyzer
Compare API specifications to detect breaking changes. Compare OpenAPI spec versions, categorize changes by severity, generate migration guides, and block breaking changes in CI.
process-analyzer
Analyze processes, identify workflows, define boundaries and scope, and map process requirements for specialization creation.
scope-logic-analyzer
Test equipment integration for signal analysis (oscilloscope and logic analyzer)
protocol-analyzer
Serial protocol analysis and debugging for common embedded interfaces (I2C, SPI, UART)