Michael John Caldwell Gordon. 28 February 1948—22 August 2017

@article{Paulson2018MichaelJC,
  title={Michael John Caldwell Gordon. 28 February 1948—22 August 2017},
  author={Lawrence Charles Paulson},
  journal={BIOGRAPHICAL MEMOIRS OF FELLOWS OF THE ROYAL SOCIETY},
  year={2018},
  pages={113 - 89}
}
Michael Gordon was a pioneer in the field of interactive theorem proving and hardware verification. In the 1970s, he had the vision of formally verifying system designs, proving their correctness using mathematics and logic. He demonstrated his ideas on real-world computer designs. His students extended the work to such diverse areas as the verification of floating-point algorithms, the verification of probabilistic algorithms and the verified translation of source code to correct machine code… Expand

References

SHOWING 1-10 OF 69 REFERENCES
Floating Point Verification in HOL Light: The Exponential Function
  • J. Harrison
  • Computer Science
  • Formal Methods Syst. Des.
  • 2000
TLDR
A machine-checked verification of an algorithm for computing the exponential function in IEEE-754 standard binary floating point arithmetic, developed logically from first principles using the HOL Light prover, which guarantees strict adherence to simple rules of inference while allowing the user to perform proofs using higher-level derived rules. Expand
Tactics for mechanized reasoning: a commentary on Milner (1984) ‘The use of machines to assist in rigorous proof’
  • M. Gordon
  • Mathematics, Medicine
  • Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
  • 2015
Robin Milner's paper, ‘The use of machines to assist in rigorous proof’, introduces methods for automating mathematical reasoning that are a milestone in the development of computer-assisted theoremExpand
From LCF to HOL: a short history
  • M. Gordon
  • Computer Science
  • Proof, Language, and Interaction
  • 2000
TLDR
The original LCF system was a proof-checking program developed at Stanford University by Robin Milner in 1972, and one of the descendents is HOL, a proof assistant for higher order logic originally developed for reasoning about hardware. Expand
The origins of structural operational semantics
  • G. Plotkin
  • Computer Science
  • J. Log. Algebraic Methods Program.
  • 2004
TLDR
The origins of structural operational semantics are reviewed, the subject of an invited course of lectures at Aarhus University, and an account of an old, previously unpublished, idea: an alternative, perhaps more readable, graphical presentation of systems of rules for operational semantics. Expand
Verification of the Miller-Rabin probabilistic primality test
  • J. Hurd
  • Mathematics, Computer Science
  • J. Log. Algebraic Methods Program.
  • 2003
TLDR
Using the HOL theorem prover, the formalization of probability theory is applied to specify and verify the Miller–Rabin probabilistic primality test and proves the stronger property of guaranteed termination. Expand
Computational logic: its origins and applications
  • Lawrence Charles Paulson
  • Computer Science, Medicine
  • Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
  • 2018
TLDR
A refinement of LCF, called Isabelle, retains advantages ofLCF while providing flexibility in the choice of logical formalism and much stronger automation. Expand
Implementation and applications of Scott's logic for computable functions
TLDR
It is shown how the syntax and semantics of a simple programming language may be described completely in the logic, and an example of a theorem which relates syntactic and semantic properties of programs and which can be stated and proved within the logic is given. Expand
CakeML: a verified implementation of ML
TLDR
This work has developed and mechanically verified an ML system called CakeML, which supports a substantial subset of Standard ML, and its formally verified compiler can bootstrap itself: it applies the verified compiler to itself to produce a verified machine-code implementation of the compiler. Expand
The emergence of first-order logic
To most mathematical logicians working in the 1980s, first-order logic is the proper and natural framework for mathematics. Yet it was not always so. In 1923, when a young Norwegian mathematicianExpand
Introduction to Mathematical Philosophy
Bertrand Russell is the most important philosopher of mathematics of the twentieth century. The author of The Principles of Mathematics and, with Alfred Whitehead, the massive Principia Mathematica ,Expand
...
1
2
3
4
5
...