License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSCD.2016.4
URN: urn:nbn:de:0030-drops-59701
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/5970/
Go to the corresponding LIPIcs Volume Portal

Nipkow, Tobias

Verified Analysis of Functional Data Structures

pdf-format:
LIPIcs-FSCD-2016-4.pdf (0.3 MB)

Abstract

In recent work the author has analyzed a number of classical
functional search tree and priority queue implementations with the
help of the theorem prover Isabelle/HOL. The functional correctness
proofs of AVL trees, red-black trees, 2-3 trees, 2-3-4 trees, 1-2
brother trees, AA trees and splay trees could be automated. The
amortized logarithmic complexity of skew heaps, splay trees, splay
heaps and pairing heaps had to be proved manually.

BibTeX - Entry

@InProceedings{nipkow:LIPIcs:2016:5970,
  author =	{Tobias Nipkow},
  title =	{{Verified Analysis of Functional Data Structures}},
  booktitle =	{1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016)},
  pages =	{4:1--4:2},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-010-1},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{52},
  editor =	{Delia Kesner and Brigitte Pientka},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/5970},
  URN =		{urn:nbn:de:0030-drops-59701},
  doi =		{10.4230/LIPIcs.FSCD.2016.4},
  annote =	{Keywords: Program Verification, Algorithm Analysis, Functional Programming}
}

Keywords: Program Verification, Algorithm Analysis, Functional Programming
Collection: 1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016)
Issue Date: 2016
Date of publication: 17.06.2016

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI