- Home
- Best Scientists - Computer Science
- Lawrence C. Paulson

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Computer Science
D-index
54
Citations
17,243
218
World Ranking
2964
National Ranking
185

2017 - Fellow of the Royal Society, United Kingdom

2008 - ACM Fellow For contributions to theorem provers and verification techniques.

- Programming language
- Algebra
- Complex number

Lawrence C. Paulson mostly deals with Programming language, Mathematical proof, Proof assistant, Theoretical computer science and HOL. Mathematical proof and Protocol are two areas of study in which he engages in interdisciplinary research. His biological study spans a wide range of topics, including Discrete mathematics, Natural deduction, Logic for Computable Functions, Automated reasoning and Axiom.

His work carried out in the field of Discrete mathematics brings together such families of science as Resolution and Set theory. The HOL study which covers Cryptographic protocol that intersects with Public-key cryptography. His Logical framework study integrates concerns from other disciplines, such as Automated theorem proving and Calculus.

- Isabelle/HOL: A Proof Assistant for Higher-Order Logic (2168 citations)
- Isabelle: A Generic Theorem Prover (916 citations)
- The inductive approach to verifying cryptographic protocols (869 citations)

His scientific interests lie mostly in Mathematical proof, Programming language, Automated theorem proving, HOL and Computer security. His study in Mathematical proof is interdisciplinary in nature, drawing from both Correctness, Axiom and Theoretical computer science. His Automated theorem proving research also works with subjects such as

- Algebra which connect with Recursion,
- Simple which connect with Function.

His studies deal with areas such as Discrete mathematics and Polynomial as well as HOL. His Discrete mathematics research integrates issues from Axiom of choice and Set theory. His research investigates the connection between Computer security and topics such as Protocol that intersect with problems in Set and Session.

- Mathematical proof (24.91%)
- Programming language (24.22%)
- Automated theorem proving (18.69%)

- HOL (17.65%)
- Mathematical proof (24.91%)
- Proof assistant (13.49%)

Lawrence C. Paulson focuses on HOL, Mathematical proof, Proof assistant, Automated theorem proving and Discrete mathematics. His work deals with themes such as Polynomial, Symbolic computation, Algebra and Theoretical computer science, which intersect with HOL. The various areas that Lawrence C. Paulson examines in his Mathematical proof study include Programming language, Mathematical reasoning, Proposition and Cryptographic protocol.

His Programming language research focuses on subjects like Rotation formalisms in three dimensions, which are linked to Computational logic. His Proof assistant research includes elements of Proof complexity, Axiom, Calculus and Field. His Hereditarily finite set study in the realm of Discrete mathematics connects with subjects such as Argument principle, Shannon's source coding theorem and Shannon–Fano coding.

- Hammering towards QED (102 citations)
- The Higher-Order Prover Leo-II (51 citations)
- Machine Learning for First-Order Theorem Proving (49 citations)

- Programming language
- Algebra
- Complex number

Lawrence C. Paulson mainly investigates Artificial intelligence, Cylindrical algebraic decomposition, Machine learning, Mathematical proof and Quantifier elimination. The study incorporates disciplines such as Theoretical computer science and Symbolic computation in addition to Cylindrical algebraic decomposition. Lawrence C. Paulson interconnects Heuristics and Heuristic in the investigation of issues within Machine learning.

Many of his research projects under Mathematical proof are closely connected to Causal reasoning with Causal reasoning, tying the diverse disciplines of science together. He studied Proof assistant and Proof procedure that intersect with HOL. His research integrates issues of Rotation formalisms in three dimensions, Kernel and Counterexample in his study of Programming language.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Isabelle/HOL: A Proof Assistant for Higher-Order Logic

Tobias Nipkow;Markus Wenzel;Lawrence C. Paulson.

**(2002)**

4302 Citations

Isabelle: A Generic Theorem Prover

Lawrence C. Paulson;Tobias Nipkow.

**(1994)**

1447 Citations

ML for the working programmer

Laurence C. Paulson.

**(1991)**

1354 Citations

The inductive approach to verifying cryptographic protocols

Lawrence C. Paulson.

Journal of Computer Security **(1998)**

1301 Citations

Logic and computation : interactive proof with Cambridge LCF

Lawrence C. Paulson.

**(1990)**

600 Citations

The foundation of a generic theorem prover

L. C. Paulson.

Journal of Automated Reasoning **(1989)**

591 Citations

Proving properties of security protocols by induction

L.C. Paulson.

ieee computer security foundations symposium **(1997)**

420 Citations

Isabelle: The Next 700 Theorem Provers

Lawrence C. Paulson.

arXiv: Logic in Computer Science **(1993)**

394 Citations

Inductive analysis of the Internet protocol TLS

Lawrence C. Paulson.

ACM Transactions on Information and System Security **(1999)**

341 Citations

MetiTarski: Past and Future

Lawrence C. Paulson.

interactive theorem proving **(2012)**

285 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Technical University of Munich

Vrije Universiteit Amsterdam

University of Cambridge

Aalto University

Carnegie Mellon University

Aalto University

Yale University

University of Trento

Georgia Institute of Technology

Ericsson (Sweden)

French Institute for Research in Computer Science and Automation - INRIA

Publications: 57

French Institute for Research in Computer Science and Automation - INRIA

Publications: 32

University of Vienna

George Mason University

University of Leeds

Weizmann Institute of Science

Osaka University

New Jersey Institute of Technology

National Science and Technology Development Agency

University of Guelph

University of Florida

Università Campus Bio-Medico

Weizmann Institute of Science

Vanderbilt University Medical Center

University of Pittsburgh

Tilburg University

Rice University

University of Zaragoza

Something went wrong. Please try again later.