A lemma (entry) may depend on lemmas (entries) below its position, but never on lemmas above its position. This means the list is a topological order of the dependency graph. An entry 'all subs proved' means that all used lemmas are (transitively) proved.
| Name: | Status: | Subs proved? | Used: |
|---|---|---|---|
| crash-neutral-get | proved | all subs proved | get, |
| crash-neutral-set | proved | all subs proved | set, |
| crash-neutral-check-page | proved | all subs proved | check-page, |
| crash-neutral-set-status | proved | all subs proved | set-status, |
| crash-neutral-delete | proved | all subs proved | delete, |
| crash-neutral-evict | proved | all subs proved | evict, |
| crash-neutral-truncate | proved | all subs proved | truncate, |
| crash-neutral-recovery | proved | all subs proved | recovery, |
| inv-truncate | proved | all subs proved | truncate, |
| inv-evict | proved | all subs proved | evict, |
| inv-recovery | proved | all subs proved | recovery, |
| get | axiom | ||
| set | axiom | ||
| check-page | axiom | ||
| set-status | axiom | ||
| delete | axiom | ||
| truncate | axiom | ||
| evict | axiom | ||
| recovery | axiom |