verified-pseudocode-extractor

Extract language-agnostic pseudocode from Isabelle/HOL and Coq verified programs.

142|14|Updated Feb 14, 2026
One-click install
npx skills add https://github.com/ArabelaTso/Skills-4-SE --skill verified-pseudocode-extractor
Or copy as Structured Prompt for Agent
Please help me install this Agent Skill.
Skill: verified-pseudocode-extractor
Source: https://github.com/ArabelaTso/Skills-4-SE/tree/main/skills/verified-pseudocode-extractor
Command: npx skills add https://github.com/ArabelaTso/Skills-4-SE --skill verified-pseudocode-extractor

SYSTEM DOCUMENTATION & REQUIREMENTS

💡 This Skill includes references (resource) components.

What problem does it solve?

This Skill bridges the gap between formal verification code (like Isabelle/HOL or Coq) and human-readable pseudocode, making complex verified algorithms understandable to a wider audience.

Core Features & Use Cases

  • Algorithm Documentation: Generate clear pseudocode from verified implementations for documentation and knowledge sharing.
  • Cross-Language Understanding: Abstract verified logic into a language-agnostic format, aiding in translation or reimplementation.
  • Use Case: You have a critical algorithm formally verified in Coq. Use this Skill to generate pseudocode that clearly explains its logic and verified properties to non-expert developers or for academic papers.

Quick Start

Extract pseudocode from the provided Isabelle/HOL code snippet.

Frequently Asked Questions about verified-pseudocode-extractor

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

FAQPage Schema
How do I extract pseudocode from Coq or Isabelle/HOL formally verified code?

Extracting pseudocode from Coq or Isabelle/HOL involves parsing verified programs to preserve algorithmic logic and data dependencies while abstracting away proof-specific details. This outputs language-agnostic pseudocode for documenting verified algorithms.

What is the best way to document formally verified algorithms for non-expert developers?

The best way to document formally verified algorithms is translating Isabelle/HOL or Coq implementations into language-agnostic pseudocode. This clearly communicates verified algorithmic logic and control flow to non-expert developers.

Does extracting pseudocode from verified code preserve the original formal verification properties?

Yes, extracting pseudocode from verified code preserves verified control flow, data dependencies, and algorithmic logic. It strictly abstracts away proof-specific details while maintaining the core verified properties of the original formal program.

Can I use extracted pseudocode to translate or reimplement verified code in another programming language?

Yes, you can use extracted pseudocode to reimplement verified code in another language. It abstracts verified logic into a language-agnostic format, directly aiding cross-language translation while preserving the original algorithmic structure.

When should I abstract away proof-specific details from my Isabelle/HOL code?

You should abstract away proof-specific details from Isabelle/HOL code when generating documentation or creating specifications from verified code. This isolates the core algorithmic logic, making it understandable for wider audiences without formal verification expertise.