Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

The use of Hoare's method of program verification for the Quicksort algorithm

From MaRDI portal
Publication:1239604
Jump to:navigation, search

DOI10.1007/BF02244016zbMath0361.68012OpenAlexW355072141MaRDI QIDQ1239604

R. Studer, Erich J. Neuhold

Publication date: 1977

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02244016



Mathematics Subject Classification ID

General topics in the theory of software (68N01) Algorithms in computer science (68W99)


Related Items (1)

Comments on a paper by Neuhold and Studer


Uses Software

  • Find



Cites Work

  • Program proving: KJumps and functions
  • An axiomatic basis for computer programming
  • Increasing the efficiency of quicksort
  • Proof of a program
  • Proof of a recursive program: Quicksort




This page was built for publication: The use of Hoare's method of program verification for the Quicksort algorithm

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1239604&oldid=13319377"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 31 January 2024, at 07:59.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki