An assertional proof of red-black trees using Dafny (Q1984797)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7187046
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An assertional proof of red-black trees using Dafny |
scientific article; zbMATH DE number 7187046 |
Statements
An assertional proof of red-black trees using Dafny (English)
0 references
7 April 2020
0 references
data structures
0 references
balanced trees
0 references
verification platforms
0 references
0.7428431510925293
0 references
0.7406565546989441
0 references
0.7342979907989502
0 references
0.7279610633850098
0 references
0.7230959534645081
0 references
