File size: 2,968 Bytes
0863157 f1dcba7 0863157 f1dcba7 0863157 f1dcba7 0863157 f1dcba7 0863157 f07e5cc 0863157 f07e5cc 0863157 f07e5cc 0863157 f07e5cc 0863157 |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 |
---
license: mit
task_categories:
- text-generation
- feature-extraction
language:
- en
tags:
- theorem-proving
- formal-methods
- tla+
- distributed-systems
- model-checking
size_categories:
- 1K<n<10K
dataset_info:
features:
- name: fact
dtype: string
- name: type
dtype: string
- name: library
dtype: string
- name: imports
list: string
- name: filename
dtype: string
- name: symbolic_name
dtype: string
- name: docstring
dtype: string
splits:
- name: train
num_examples: 3902
configs:
- config_name: default
data_files:
- split: train
path: data/train-*
---
# TLA+
Structured dataset of TLA+ specifications from the official TLA+ Examples repository.
## Dataset Description
- **Source:** [tlaplus/Examples](https://github.com/tlaplus/Examples)
- **Entries:** 3,902
- **Files processed:** 304
- **License:** MIT
## Schema
| Column | Type | Description |
|--------|------|-------------|
| fact | string | Declaration body |
| type | string | definition, theorem, lemma, assume |
| library | string | Specification name (Paxos, DieHard, etc.) |
| imports | list | EXTENDS statements |
| filename | string | Source file path |
| symbolic_name | string | Declaration identifier |
| docstring | string | Documentation comment (where available) |
## Statistics
### By Type
| Type | Count |
|------|-------|
| definition | 3,511 |
| theorem | 224 |
| lemma | 125 |
| assume | 42 |
### By Library (Top 10)
| Library | Count |
|---------|-------|
| SpecifyingSystems | 681 |
| SDP_Verification | 468 |
| ewd998 | 290 |
| byzpaxos | 172 |
| dijkstra-mutex | 126 |
| FiniteMonotonic | 115 |
| Paxos | 108 |
| byihive | 105 |
| PaxosHowToWinATuringAward | 102 |
| LoopInvariance | 100 |
## About TLA+
TLA+ is a formal specification language developed by Leslie Lamport for designing, modeling, and verifying concurrent and distributed systems. It is widely used in industry (Amazon, Microsoft, Oracle) to verify critical system designs before implementation.
Key features:
- Based on set theory and temporal logic
- Model checking via TLC
- Proof system via TLAPS
- Used for consensus protocols, distributed databases, and concurrent algorithms
## Use Cases
- Retrieval/RAG for TLA+ specifications
- Learning distributed systems patterns
- Training embeddings for formal specifications
- Semantic search over protocol designs
## Related Datasets
- [Coq-Verdi](https://huggingface.co/datasets/phanerozoic/Coq-Verdi) - Verified distributed systems in Coq
- [Coq-Iris](https://huggingface.co/datasets/phanerozoic/Coq-Iris) - Concurrent separation logic
- [Lean4-Mathlib](https://huggingface.co/datasets/phanerozoic/Lean4-Mathlib) - Mathematical formalizations
## Citation
If you use this dataset, please cite the TLA+ Examples repository:
```bibtex
@software{tlaplus_examples,
title={TLA+ Examples},
url={https://github.com/tlaplus/Examples},
publisher={TLA+ Foundation}
}
```
|