Stainless framework and balanced binary search trees
Stainless pro vyvažované binární vyhledávací stromy
Authors
Supervisors
Reviewers
Editors
Other contributors
Journal Title
Journal ISSN
Volume Title
Publisher
České vysoké učení technické v Praze
Czech Technical University in Prague
Czech Technical University in Prague
Date of defense
2025-06-19
Abstract
Tato práce se zabývá verifikovanou implementací vyvažovaných binárních vyhledávacích stromů pomocí jazyka Scala a frameworku Stainless. Konkrétními zkoumanými stromy jsou AVL a (left-leaning) red-black stromy. Stromy jsou využity k implementaci datové struktury množina.
This thesis focuses on a verified implementation of balanced binary search trees using the Scala language and the Stainless framework. The specific variants of trees examined are AVL and (left-leaning) red-black trees. The trees are used to implement the set data structure.
This thesis focuses on a verified implementation of balanced binary search trees using the Scala language and the Stainless framework. The specific variants of trees examined are AVL and (left-leaning) red-black trees. The trees are used to implement the set data structure.
Description
Citation
Underlying research data set URL
Permanent link
Rights/License
Vysokoškolská závěrečná práce je dílo chráněné autorským zákonem. Je možné pořizovat z něj na své náklady a pro svoji osobní potřebu výpisy, opisy a rozmnoženiny. Jeho využití musí být v souladu s autorským zákonem v platném znění.
A university thesis is a work protected by the Copyright Act of the Czech Republic. Extracts, copies and transcripts of the thesis are allowed for personal use only and at one`s own expense. The use of thesis should be in compliance with the Copyright Act.
A university thesis is a work protected by the Copyright Act of the Czech Republic. Extracts, copies and transcripts of the thesis are allowed for personal use only and at one`s own expense. The use of thesis should be in compliance with the Copyright Act.