invariant-guard - Correctness-first algorithm design
Requires contracts, invariants, termination arguments, base cases, and edge-case analysis before producing or reviewing algorithmic code.
Tags
Updated: 2026-10-04Capabilities
Typical Inputs
Typical Outputs
What this skill does
- State function contracts
- Write loop invariants
- Prove termination measures
- Define recursion base cases
- Enumerate applicable edge cases
- Encode illegal states
- Verify postconditions against invariants
- Produce code after protocol
Inputs
- Algorithm or function specification
- Source code under review
- Programming language constraints
Outputs
- Function contract
- Loop invariants
- Termination arguments
- Recursion base cases and measures
- Edge-case table
- Algorithmic source code
- Self-check statements