invariant-guard - Correctness-first algorithm design
Requires contracts, invariants, termination arguments, base cases, edge cases, and verification before producing non-trivial algorithmic code.
Tags
Updated: 2026-10-04Capabilities
Typical Inputs
Typical Outputs
What this skill does
- Define function contracts
- State loop invariants
- Provide termination arguments
- Specify recursion base cases
- Enumerate applicable edge cases
- Encode illegal states
- Verify postconditions
- Generate protocol-compliant code
Inputs
- Algorithm specification
- Function requirements
- Existing implementation code
- Programming language constraints
Outputs
- Function contract
- Loop invariants
- Termination arguments
- Recursion base cases
- Edge-case expectations
- Algorithm implementation
- Correctness self-check