CORE
CO
nnecting
RE
positories
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Research partnership
About
About
About us
Our mission
Team
Blog
FAQs
Contact us
Community governance
Governance
Advisory Board
Board of supporters
Research network
Innovations
Our research
Labs
research
Quicksort Revisited: Verifying Alternative Versions of Quicksort
Authors
C Hoare
C Hoare
+5 more
K Apt
KRM Leino
M Foley
S Gouw de
Z Manna
Publication date
13 March 2016
Publisher
'Springer Science and Business Media LLC'
Doi
Cite
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
Similar works
Full text
Available Versions
Crossref
See this paper in CORE
Go to the repository landing page
Download from data provider
info:doi/10.1007%2F978-3-319-3...
Last time updated on 03/12/2019
Supporting member
Spiral - Imperial College Digital Repository
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:spiral.imperial.ac.uk:1004...
Last time updated on 17/02/2017