Lawrence Paulson

Citeras av

	Alla	Sedan 2017
Citat	19219	3844
h-index	55	25
i10-index	127	51

900

450

225

675

1988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202266 79 111 98 157 241 287 258 329 323 448 510 428 580 558 692 586 710 740 820 889 827 783 617 740 811 765 711 714 696 726 838 686 711 185

Offentlig åtkomst

Visa alla

45 artiklar

1 artikel

tillgänglig

inte tillgänglig

Enligt krav från finansiärer

Medförfattare

Tobias NipkowProfessor of Computer Science, Technische Universität MünchenVerifierad e-postadress på in.tum.de
Christoph BenzmüllerFull Professor at University of Bamberg & Professor (apl.) at FU BerlinVerifierad e-postadress på fu-berlin.de
Fabio MassacciChair at Vrije Universiteit, Netherlands and prof. at University of Trento, ItalyVerifierad e-postadress på ieee.org
Jasmin BlanchetteVrije Universiteit AmsterdamVerifierad e-postadress på vu.nl
Florian KammüllerAssociate Professor, Middlesex University London and Privatdozent TU BerlinVerifierad e-postadress på mdx.ac.uk
Matthew EnglandCoventry UniversityVerifierad e-postadress på coventry.ac.uk
James DavenportHebron & Medlock Professor of Information Technology, University of Bath; former Vice-President, BCSVerifierad e-postadress på bath.ac.uk
Gerwin KleinProofcraft and UNSWVerifierad e-postadress på unsw.edu.au
Krzysztof GrąbczewskiNicolaus Copernicus University, Toruń, PolandVerifierad e-postadress på is.umk.pl
David John WilsonUniversity of BathVerifierad e-postadress på bath.ac.uk
Sofiene TaharConcordia UniversityVerifierad e-postadress på ece.concordia.ca
Cezary KaliszykUniversity of InnsbruckVerifierad e-postadress på uibk.ac.at
Josef UrbanDistinguished Researcher at Czech Technical University in PragueVerifierad e-postadress på cvut.cz
Grant Olney PassmoreImandra Inc. and Clare Hall, University of CambridgeVerifierad e-postadress på cl.cam.ac.uk
William DenmanOrbis InvestmentsVerifierad e-postadress på orbis.com
Leonardo de MouraSenior Principal Researcher at MicrosoftVerifierad e-postadress på microsoft.com
Jean Everson MartinaSenior Lecturer, Federal University of Santa CatarinaVerifierad e-postadress på ufsc.br
Andrew SogokonCarnegie Mellon UniversityVerifierad e-postadress på andrew.cmu.edu
Andrew DM SmithUniversity of StirlingVerifierad e-postadress på stir.ac.uk

Följ

Lawrence Paulson

University of Cambridge

Verifierad e-postadress på cam.ac.uk - Startsida

automated theorem proving formalisation of mathematics computer security


Titel Sortera efter citat Sortera efter år Sortera efter titel	Citeras av Citeras av	År
Isabelle/HOL: a proof assistant for higher-order logic T Nipkow, M Wenzel, LC Paulson Springer Berlin Heidelberg, 2002	4373	2002
Isabelle: A generic theorem prover LC Paulson Springer Berlin Heidelberg, 1994	2317*	1994
ML for the Working Programmer LC Paulson, LC Paulson Cambridge University Press, 1996	1340	1996
The inductive approach to verifying cryptographic protocols LC Paulson Journal of computer security 6 (1-2), 85-128, 1998	1280	1998
The foundation of a generic theorem prover LC Paulson Journal of Automated Reasoning 5 (3), 363-397, 1989	588	1989
Logic and computation: interactive proof with Cambridge LCF LC Paulson Cambridge University Press, 1990	582	1990
Proving properties of security protocols by induction LC Paulson Proceedings 10th Computer Security Foundations Workshop, 70-83, 1997	409	1997
Inductive analysis of the internet protocol TLS LC Paulson ACM Transactions on Information and System Security (TISSEC) 2 (3), 332-351, 1999	339	1999
Metitarski: Past and future LC Paulson International Conference on Interactive Theorem Proving, 1-10, 2012	287	2012
Natural deduction as higher-order resolution LC Paulson The Journal of Logic Programming 3 (3), 237-258, 1986	215	1986
The Isabelle reference manual LC Paulson University of Cambridge, Computer Laboratory, 1993	196	1993
Kerberos version IV: Inductive analysis of the secrecy goals G Bella, LC Paulson European Symposium on Research in Computer Security, 361-375, 1998	193	1998
Mechanized proofs for a recursive authentication protocol LC Paulson Proceedings 10th Computer Security Foundations Workshop, 84-94, 1997	186	1997
Should your specification language be typed L Lamport, LC Paulson ACM Transactions on Programming Languages and Systems (TOPLAS) 21 (3), 502-526, 1999	181	1999
The isabelle framework M Wenzel, LC Paulson, T Nipkow International Conference on Theorem Proving in Higher Order Logics, 33-38, 2008	177	2008
A higher-order implementation of rewriting LC Paulson arXiv preprint cs/9301108, 2001	164	2001
Hammering towards QED JC Blanchette, C Kaliszyk, LC Paulson, J Urban Journal of Formalized Reasoning 9 (1), 101-148, 2016	162	2016
Translating higher-order clauses to first-order clauses J Meng, LC Paulson Journal of Automated Reasoning 40 (1), 35-60, 2008	156	2008
LEO-II-a cooperative automatic theorem prover for classical higher-order logic (system description) C Benzmüller, LC Paulson, F Theiss, A Fietzke International Joint Conference on Automated Reasoning, 162-170, 2008	154	2008
Extending Sledgehammer with SMT solvers JC Blanchette, S Böhme, LC Paulson Journal of automated reasoning 51 (1), 109-128, 2013	147	2013

Systemet kan inte utföra åtgärden just nu. Försök igen senare.

Artiklar 1–20

Citat per år

Dubblettcitat

Sammanfogade citat

Lägg till medförfattareMedförfattare

Följ den här författaren

Citeras av

Medförfattare