skills.rest
ArabelaTso
ArabelaTsoCOMMUNITY
Explore all skills by this author →
WebsiteGitHub

program-correctness-prover

Generate Hoare logic proofs for imperative programs in Isabelle/HOL or Coq.

142|14|Updated Feb 14, 2026
Search Tags:#program verification#formal methods#coq#isabelle#hoare logic#correctness proof
One-click install
npx skills add https://github.com/ArabelaTso/Skills-4-SE --skill program-correctness-prover
Or copy as Structured Prompt for Agent▼
Please help me install this Agent Skill.
Skill: program-correctness-prover
Source: https://github.com/ArabelaTso/Skills-4-SE/tree/main/skills/program-correctness-prover
Command: npx skills add https://github.com/ArabelaTso/Skills-4-SE --skill program-correctness-prover

SYSTEM DOCUMENTATION & REQUIREMENTS

💡 This Skill includes scripts (resource) and references (resource) components.

What problem does it solve?

This Skill automates the generation of formal proofs for the correctness of imperative programs, ensuring reliability and correctness through mathematical rigor.

Core Features & Use Cases

  • Formal Verification: Prove partial or total correctness of programs using Hoare logic.
  • Automated Proof Generation: Generates proofs in Isabelle/HOL or Coq.
  • Invariant & VC Generation: Assists in constructing loop invariants and verification conditions.
  • Use Case: You have a critical piece of C code for a financial calculation. Use this Skill to formally prove that it always produces the correct output given its specifications, eliminating potential bugs.

Quick Start

Use the program-correctness-prover skill to generate an Isabelle proof for the sum of array example.

Frequently Asked Questions about program-correctness-prover

High-intent search queries and answers about installing and using this skill.

FAQPage Schema
How do I generate a Hoare logic correctness proof for an imperative program?▼

You can generate loop invariants and verification conditions for imperative programs, which are then outputted as formal correctness proofs in Isabelle/HOL or Coq syntax to ensure software reliability.

Can I generate verification conditions for Coq and Isabelle?▼

Yes, this approach generates verification conditions and loop invariants directly compatible with Coq and Isabelle/HOL to mathematically prove the correctness of safety-critical imperative software.

When do I need formal program verification for safety-critical systems?▼

Formal program verification is necessary for safety-critical systems to mathematically eliminate potential bugs by proving that imperative programs execute exactly according to their formal specifications using Hoare logic.

How do I prove partial or total correctness of imperative programs with loops?▼

To prove partial or total correctness of programs with loops, you use Hoare logic to automatically generate loop invariants and verification conditions, validating control flow and state changes against formal specifications.

Does this approach support proving correctness for C code used in financial calculations?▼

Yes, you can formally verify critical C code for financial calculations by generating mathematical proofs using Hoare logic, eliminating potential bugs by guaranteeing the code meets its formal specifications.

Related Skills

Explore More Software Engineering Skills→
rainoftimerainoftime
17

axiomatic-semantics

Define program correctness using Hoare logic and weakest preconditions.

Community
Intermediate
ArabelaTsoArabelaTso
142

counterexample-debugger

Analyze Nitpick and QuickChick counterexamples to identify proof failure root causes.

Community
Intermediate
rainoftimerainoftime
17

hoare-logic-verifier

Verify imperative program correctness using Hoare logic and loop invariants.

Community
Intermediate
santosomarsantosomar
1

smv-model-extractor

Extract finite-state SMV models from source code for formal verification.

Community
Intermediate