Related Concepts
Definition
Theorem proving is the use of automated techniques to provide mathematically sound proofs of theorems. Theorem provers are programs that provide such automated support.
Background
Because a theorem prover generally will support proofs of a large class of (usually undecidable) theorems, it requires interaction with the user. The prover will possess a set of proof tactics that it can apply, but the user may be required to choose which tactics, or even suggest tactics of his or her own. Some theorem provers also function as proof checkers, in which the user writes the proof him or herself, and use the theorem prover to check its validity. Because of their wide scope and the ability to interact with a sophisticated user, provers are especially useful for difficult problems that cannot be solved by other...
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Owre S, Shankar N, Rushby J (1992) PVS: a prototype verification system. In: CADE 11, Saratoga Springs
Kaufmann M, Manolios P, Moore JS (2000) Computer-aided reasoning: an approach. Academic, Boston
Nipkow T, Paulson L, Wenzel M (2010) Isabelle/HOL: a proof-assistant for higher-order logic. Springer, Berlin
Bertot Y, Casteran P (2004) Interactive theorem proving and protocol development. Coq’Art: the calculus of inductive constructions. Springer, Berlin
Benzel TV (1984) Analysis of a Kernel verification. In: Proceedings of 1984 IEEE security and privacy, Oakland. IEEE Computer Society Press, Silver Spring
Heitmeyer CL, Archer M, Leonard EI, McLean J (2008) Applying formal methods to a certifiably secure software system. IEEE Trans Softw Eng 34(1):82–98
Paulson L (1998) The inductive approach to verifying cryptographic protocols. J Comput Secur 6:85–128
Youn P, Adida B, Bond M, Clulow J, Herzog J, Lin A, Rivest RL, Anderson R (2005) Robbing the bank with a theorem prover. Cambridge University Computer Laboratory Technical Report UCAM-CL-TR-644
Bellare M, Rogaway P (2006) Code-based game-playing proofs and the security of triple encryption. In: EUROCRYPT 2006, St. Petersburg. LNCS, vol 4004. Springer, Berlin
Nowak D (2008) On formal verification of arithmetic-based cryptographic primitives. In: Proceedings of information security and cryptology – ICISC 2008, Seoul. Springer, Berlin, pp 368–382
Barthe G, Grégoire B, Béguelin SZ (2009) Formal certification of code-based cryptographic proofs. In: POPL 2009, Savannah, ACM, pp 90–101
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer Science+Business Media, LLC
About this entry
Cite this entry
Meadows, C. (2011). Theorem Proving and Security. In: van Tilborg, H.C.A., Jajodia, S. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-5906-5_869
Download citation
DOI: https://doi.org/10.1007/978-1-4419-5906-5_869
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-5905-8
Online ISBN: 978-1-4419-5906-5
eBook Packages: Computer ScienceReference Module Computer Science and Engineering