Knowra Tony Hoare Tony Hoare Tony Hoare is a British computer scientist known for Quicksort, Hoare logic, and foundational contributions to programming languages and concurrent systems.
Quicksort : A sorting algorithm that partitions elements around a pivot and recursively sorts the resulting parts. Hoare devised this algorithm while working on machine translation in the early 1960s.
Charles Antony Richard Hoare : The full name of British computer scientist Tony Hoare, born in 1934. His education and early career shaped the work associated with his shorter public name.
Robin Milner : A British computer scientist known for contributions to programming languages, type systems, and concurrency. Milner and Hoare both shaped formal approaches to programming and concurrent computation.
Formal verification : The use of mathematical methods to prove that a system satisfies specified properties. Hoare’s assertion-based reasoning became a foundation for proving program correctness.
Dijkstra's algorithm : An algorithm for finding shortest paths from one source in a graph with nonnegative edge weights. Unlike Quicksort, it solves a graph optimization problem rather than sorting a sequence.
Hoare logic : A formal system for reasoning about programs using assertions before and after commands. Hoare introduced this logic to express and prove program correctness.
Moscow State University : A public research university in Moscow, Russia, founded in 1755. Hoare studied under Andrey Kolmogorov there, encountering algorithmic problems that led toward Quicksort.
Edsger W. Dijkstra : A Dutch computer scientist known for foundational work on algorithms, programming methodology, and formal reasoning. Dijkstra’s structured-programming ideas offer a close intellectual counterpart to Hoare’s work on program proof.
Separation logic : An extension of Hoare logic for reasoning about programs that manipulate shared mutable memory. It extends Hoare-style proofs to local reasoning about heap-manipulating programs.
Petri net : A mathematical model of concurrent systems using places, transitions, and tokens. Petri nets model concurrency with a state-based formalism distinct from CSP’s communicating processes.
Show all 26