Quicksort Revisited: Verifying Alternative Versions of Quicksort

File Description SizeFormat 
quicksort.pdfAccepted version379.21 kBAdobe PDFView/Open
Title: Quicksort Revisited: Verifying Alternative Versions of Quicksort
Authors: Certezeanu, R
Drossopoulou, S
Egelund-Muller, B
Leino, KRM
Sivarajan, S
Wheelhouse, M
Item Type: Chapter
Abstract: © Springer International Publishing Switzerland 2016.We verify the correctness of a recursive version of Tony Hoare’s quicksort algorithm using the Hoare-logic based verification tool Dafny. We then develop a non-standard, iterative version which is based on a stack of pivot-locations rather than the standard stack of ranges. We outline an incomplete Dafny proof for the latter.
Issue Date: 13-Mar-2016
URI: http://hdl.handle.net/10044/1/34366
DOI: http://dx.doi.org/10.1007/978-3-319-30734-3_27
ISBN: 9783319307336
Publisher: Springer International Publishing
Start Page: 407
End Page: 426
Journal / Book Title: Theory and Practice of Formal Methods: Essays Dedicated to Frank de Boer on the Occasion of His 60th Birthday
Lecture Notes in Computer Science
Volume: 9660
Copyright Statement: © Springer Verlag 2016. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-30734-3_27
Keywords: Artificial Intelligence & Image Processing
08 Information And Computing Sciences
Publication Status: Published
Appears in Collections:Faculty of Engineering
Computing



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Creative Commons