一键导入
spec-failure-domain-analysis
Identify unstated failure modes, identity confusion, purity gaps, and topological edge cases in ISO-style specifications.
用 Codex 或 Claude 帮你安装 复制这段 Prompt,粘贴到 Codex、Claude 或其他助手里,让它检查 Skill 页面并帮你完成安装。
菜单
Identify unstated failure modes, identity confusion, purity gaps, and topological edge cases in ISO-style specifications.
用 Codex 或 Claude 帮你安装 复制这段 Prompt,粘贴到 Codex、Claude 或其他助手里,让它检查 Skill 页面并帮你完成安装。
基于 SOC 职业分类
Convert ISO spec requirements (StR, FR, NFR) into a TDD-based project plan with dependency analysis, parallel execution tracks, quality gates, and task decomposition. Selects or starts a plan and writes a frontmatter-typed plan bundle under plan/<Plan-id>-<slug>/ (Plan + Task + index + log).
Create or update spec artifacts from a design or change request. Orchestrates authoring each requested requirement type (StR/US/FR/NFR/IT) as a discrete file using quoin catalog templates and Quire validation.
Analyze requirement statements (FR/NFR/StR) for EARS requirement-grammar conformance and author a SpecReview of the findings.
Build and maintain the requirements Test Matrix ensuring 100% coverage.
Review requirements for quality, consistency, and completeness.
Verify a targeted plan is complete and validated — every task done, the Test Matrix backed by real tracking tags in tests, and code fully traced to spec (flagging underspecified code with no owning requirement). Optional semantic review checks that intent↔test↔code actually agree. Emits a quire-validated SpecReview artifact to reviews/YY-MM-DD-<slug>.md.
| name | spec-failure-domain-analysis |
| description | Identify unstated failure modes, identity confusion, purity gaps, and topological edge cases in ISO-style specifications. |
Run this skill during spec review to catch common omissions before implementation.
spec-to-plan (part of its readiness gate)For each callback, hook, observer, or plugin interface:
For each core domain entity (State, Event, User, etc.):
name property"For each user-supplied logic (guards, filters, validators):
For each graph/tree algorithm (search, path-finding):
Document any missing constraints as proposed additions: