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.
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… 
2010
2010
Comparison of 1.85mm line reflect line and offset short calibration
This paper shows how the S-parameters in 1.85 mm coaxial line systems can be defined in a traceable way. It is found that a very… 
2008
2008
Code-carrying theory
Code-Carrying Theory (CCT) is an alternative to the Proof-Carrying Code (PCC) approach to secure delivery of code. With PCC, code… 
Review
2007
Review
2007
Computers, Justification, and Mathematical Knowledge
The original proof of the four-color theorem by Appel and Haken sparked a controversy when Tymoczko used it to argue that the… 
2005
2005
Service-oriented software reengineering: Bertie3 as Web services
This research proposes to modernize a legacy software system by using Web services as the main building blocks of the software… 
2003
2003
Towards an interactive Mathematical Proof Language
Formalizing mathematical proofs has as aim to represent arbitrary mathematical notions and proofs on a computer in order to… 
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… 
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… 
1993
1993
A Formal Verification of the Alternating Bit Protocol in the Calculus of Constructions
We report on a formal verification of the Alternating Bit Protocol (ABP) in the Calculus of Constructions. We outline a semi… 
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)