Lawrence Paulson (http://www.cl.cam.ac.uk/~lp15/) is Professor of Computational Logic at the University of Cambridge, where he has held established positions since 1983. He has written nearly 100 refereed conference and journal papers as well as four books. He introduced the popular [Isabelle](http://www.cl.cam.ac.uk/research/hvg/Isabelle/) theorem proving environment in 1986, and made contributions to the verification of cryptographic protocols, the formalisation of mathematics, automated theorem proving technology, and other fields. Specific accomplishments include a formal analysis of the ubiquitous TLS protocol, which is used to secure online shopping, and the formal verification of Gödel's second incompleteness theorem.
In 2008, he introduced MetiTarski (http://www.cl.cam.ac.uk/~lp15/papers/Arith/), an automatic theorem prover for real-valued functions such as logarithms and exponentials. He has supervised over 20 postgraduate students and numerous postdoctoral researchers. He has the honorary title of Distinguished Affiliated Professor (http://www4.in.tum.de/~paulson/) from the Technical University of Munich and is an ACM Fellow (http://awards.acm.org/award_winners/paulson_4585196.cfm).
Professional position
- Professor of Computational Logic, Computer Laboratory, University of Cambridge
Subject groups
- Engineering
Computer engineering (including software)
- Other
Other interests
- Computer sciences
Computer science (excl engineering aspects)
