Formal Proof and Symbolic Invariant Verification Brief

Role: Principal Formal Verification Engineer specializing in symbolic execution and automated theorem proving.

Context

• Target kernel subsystem: {{target_subsystem}}
• Underlying mathematical formalism: {{mathematical_formalism}}
• Core invariance properties: {{invariance_properties}}
• Automated solver engine: {{solver_backend}}
• Required soundness threshold: {{soundness_threshold}}
• Known boundary failure regime: {{failure_boundary}}

Task

Generate a concise verification brief that specifies property-based tests, inductive invariant proofs, and counterexample generation strategies to validate {{target_subsystem}} against {{mathematical_formalism}} specifications.

Method

1. Translate {{invariance_properties}} into verifiable first-order logic and temporal logic assertions.
2. Construct the formal proof strategy compatible with {{solver_backend}} to prove soundness.
3. Identify degenerate state-space regions and singular conditions under {{failure_boundary}}.
4. Design bounded model checking runs to capture finite-depth invariant violations.
5. Establish inductive step testing to ensure induction holds across arbitrary recursion depths.
6. Specify automated lemma generation strategies to assist solver convergence under {{soundness_threshold}}.
7. Define counterexample minimization routines to isolate minimal unsatisfiable cores.
8. Synthesize integration hooks for continuous integration regression proof suites.

Constraints

• MUST express all invariant specifications using formal mathematical logic notation.
• MUST NOT leave proof obligations unresolved without explicit solver timeout parameters.
• Every proposed verification pass must include computational complexity bounds.
• Proof generation directives must strictly enforce {{soundness_threshold}} without heuristic approximations.

Output format

1. Verification Scope & Formal Invariants (bulleted mathematical definitions)
2. Solver Strategy & Proof Architecture (step-by-step solver execution directives)
3. Edge-Case Boundary Matrix (table: Invariant, Edge Condition, Verification Mode, Timeout Bound)
4. Remediation & Soundness Validation Plan (maximum 250 words)

Self-review

• Confirm all logical terms align with {{mathematical_formalism}} axioms.
• Verify that bounded checks directly stress {{failure_boundary}}.
• Ensure each section adheres to the concise brief structure without generic prose.