---
license: bsd-2-clause
task_categories:
  - text-generation
  - feature-extraction
language:
  - en
tags:
  - theorem-proving
  - formal-methods
  - coq
  - vst
  - verification
  - separation-logic
size_categories:
  - 10K<n<100K
dataset_info:
  features:
  - {name: statement, dtype: string}
  - {name: proof, dtype: string}
  - {name: type, dtype: string}
  - {name: symbolic_name, dtype: string}
  - {name: library, dtype: string}
  - {name: filename, dtype: string}
  - {name: imports, list: string}
  - {name: deps, list: string}
  - {name: docstring, dtype: string}
  - {name: source_url, dtype: string}
  - {name: commit, dtype: string}
  splits:
  - {name: train, num_examples: 43717}
  config_name: default
configs:
- config_name: default
  data_files:
  - split: train
    path: data/train-*
---

# Coq-VST

A structured dataset of formalizations from the **Verified Software Toolchain (VST)**, a framework for proving correctness of C programs using separation logic in Coq.

## Source

- Repository: https://github.com/PrincetonUniversity/VST
- Commit: `dcb836404f5e65b4fe565837b61d42cf7d0b0f2c`
- Files: 1424
- License: bsd-2-clause

## Schema

| Column | Type | Description |
|--------|------|-------------|
| statement | string | Declaration signature/claim with the leading keyword removed (verbatim slice); the full declaration minus its proof |
| proof | string | Verbatim proof/body, empty if the declaration has none |
| type | string | Declaration keyword |
| symbolic_name | string | Declaration identifier |
| library | string | Sub-library |
| filename | string | Repository-relative source path |
| imports | list[string] | File-level `Require`/`Import` modules |
| deps | list[string] | Intra-corpus identifiers referenced |
| docstring | string | Preceding documentation comment, empty if absent |
| source_url | string | Upstream repository |
| commit | string | Upstream commit extracted |

## Statistics

- Entries: 43,717
- With proof: 42,115 (96.3%)
- With docstring: 4,469 (10.2%)
- Libraries: 77

### By type

| Type | Count |
|---|---|
| Lemma | 18,960 |
| Definition | 14,271 |
| Theorem | 2,640 |
| Ltac | 1,606 |
| Fixpoint | 943 |
| Inductive | 922 |
| Axiom | 842 |
| Notation | 838 |
| Instance | 825 |
| Parameter | 431 |
| Remark | 290 |
| Hypothesis | 254 |
| Record | 211 |
| Corollary | 197 |
| Let | 127 |
| Class | 109 |
| CoInductive | 82 |
| Function | 43 |
| Coercion | 42 |
| Ltac2 | 29 |
| Scheme | 16 |
| Example | 16 |
| Canonical | 8 |
| CoFixpoint | 6 |
| Structure | 4 |
| Parameters | 3 |
| Variant | 1 |
| Fact | 1 |

## Example

```
v___stringlit_1
:= {|
  gvar_info := (tarray tschar 4);
  gvar_init := (Init_int8 (Int.repr 101) :: Init_int8 (Int.repr 110) ::
                Init_int8 (Int.repr 99) :: Init_int8 (Int.repr 0) :: nil);
  gvar_readonly := true;
  gvar_volatile := false
|}.
```

- type: Definition | symbolic_name: `v___stringlit_1` | aes/aes.v

## Use

Each declaration is split into a `statement` (signature/claim) and a `proof` (body) that are disjoint
and together form the complete declaration, for proof modeling, autoformalization, retrieval, and
dependency analysis via `deps`.

## Citation

```bibtex
@misc{coq_vst_dataset,
  title  = {Coq-VST},
  author = {Norton, Charles},
  year   = {2026},
  note   = {Extracted from https://github.com/PrincetonUniversity/VST, commit dcb836404f5e},
  url    = {https://huggingface.co/datasets/phanerozoic/Coq-VST}
}
```