Verified Analysis of Random Binary Tree Structures

This work is a case study of the formal verification and complexity analysis of some famous probabilistic algorithms and data structures in the proof assistant Isabelle/HOL. In particular, we consider the expected number of comparisons in randomised quicksort, the relationship between randomised qui...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of automated reasoning Ročník 64; číslo 5; s. 879 - 910
Hlavní autoři: Eberl, Manuel, Haslbeck, Max W., Nipkow, Tobias
Médium: Journal Article
Jazyk:angličtina
Vydáno: Dordrecht Springer Netherlands 01.06.2020
Springer Nature B.V
Témata:
Algorithms
Artificial Intelligence
Binary system
Computer Science
Data structures
Mathematical Logic and Formal Languages
Mathematical Logic and Foundations
Randomization
Symbolic and Algebraic Manipulation
Theorem proving
Randomised algorithms
Binary search trees
Quicksort
Interactive theorem proving
Isabelle
Randomised data structures
ISSN:0168-7433, 1573-0670
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This work is a case study of the formal verification and complexity analysis of some famous probabilistic algorithms and data structures in the proof assistant Isabelle/HOL. In particular, we consider the expected number of comparisons in randomised quicksort, the relationship between randomised quicksort and average-case deterministic quicksort, the expected shape of an unbalanced random Binary Search Tree, the randomised binary search trees described by Martínez and Roura, and the expected shape of a randomised treap. The last three have, to our knowledge, not been analysed using a theorem prover before and the last one is of particular interest because it involves continuous distributions.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0168-7433
1573-0670
DOI:10.1007/s10817-020-09545-0