invariant-guard - Write correctness contracts before algorithmic code
Requires written contracts, invariants, termination arguments, base cases, and edge-case analysis before producing or reviewing non-trivial loops or recursion.
Tags
Updated: 2026-10-04Capabilities
Typical Inputs
Typical Outputs
What this skill does
- State function contracts
- Write loop invariants
- Prove loop termination
- Define recursion base cases
- List applicable edge cases
- Encode illegal states
- Verify postconditions
Inputs
- Algorithm family
- Function specification
- Existing algorithm code
- Programming language context
Outputs
- Written function contract
- Loop invariants
- Termination arguments
- Recursion base cases
- Edge-case table
- Correctness-focused code
- Self-check statements
Requirements
- Chosen algorithm family
- mathguard for approximate algorithms