Skip to search formSkip to main contentSkip to account menu

Automated proof checking

Known as: Automated theorem checker, Automated proof verifier, Automated proof verifiicator 
Automated proof checking is the process of using software for checking proofs for correctness. It is one of the most developed fields in automated… 
Wikipedia (opens in a new tab)

Related topics

Related topics

14 relations
Automated reasoningAutomated theorem provingDon SymeFormal verification

Broader (1)

Formal methods

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
S-Audit: Efficient Data Integrity Verification for Cloud Storage
Commercial cloud storage services are being widely adopted. The most common integrity verification methods for data stored… 
2013
2013
Automated proof checking in introductory discrete mathematics classes
Mathematical rigor is an essential concept to learn in the study of computer science. In the process of learning to write math… 
2006
2006
Certified Higher-Order Recursive Path Ordering
The paper reports on a formalization of a proof of well-foundedness of the higher-order recursive path ordering (HORPO) in the… 
1999
1999
Formal verification of synthesized analog designs
We present an approach for formal verification of the DC and low frequency behavior of synthesized analog designs containing… 
1999
1999
Decision procedures for the analysis of cryptographic protocols by logics of belief
  • D. Monniaux
  • Proceedings of the 12th IEEE Computer Security…
  • 1999
  • Corpus ID: 11283134
Belief-logic deductions are used in the analysis of cryptographic protocols. We show a new method to decide such logics. In… 
1995
1995
Verifying Part of the ACCESS.bus Protocol Using PVS
Based on a compositional framework for the formal specification of distributed real-time systems, we present a method for… 
1988
1988
The Formal Verification of Safety-critical Assembly Code
Review
1988
Review
1988
A view of automated proof checking and proving
Different techniques of automated formal reasoning are described and their performance and requirements on the human user are… 
1986
1986
PROOF CHECKING THE RSA PUBLIC KEY ENCRYPTION ALGORITHM11The research reported here was supported by National Science Foundation Grant MCS-8202943 and Office of Naval Research Contract N00014-81-K…
1973
1973
Axioms and theorems for integers, lists and finite sets in LCF.
LCF (Logic for Computable Functions) is being promoted as a formal language suitable for the discussion of various problems in… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)