Skip to search formSkip to main contentSkip to account menu

Proof assistant

Known as: Interactive proof assistant, Proof script, Proof editor 
In computer science and mathematical logic, a proof assistant or interactive theorem prover is a software tool to assist with the development of… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
ACL2ALF (proof assistant)ATSAgda

Broader (1)

Automated theorem proving

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Modern Perspectives in Type-Theoretical Semantics
This book is a collective volume that reports the state of the art in the applications of type theory to linguistic semantics… 
2015
2015
Verifying Reachability-Logic Properties on Rewriting-Logic Specifications
Rewriting Logic is a simply, flexible, and powerful framework for specifying and analysing concurrent systems. Reachability Logic… 
2014
2014
Polarities & Focussing: a journey from Realisability to Automated Reasoning
This dissertation explores the roles of polarities and focussing in various aspects of Computational Logic.These concepts play a… 
Review
2008
Review
2008
An ACL2 Tutorial
We describe a tutorial that demonstrates the use of the ACL2 theorem prover. We have three goals: to enable a motivated reader to… 
2006
2006
A Tableau for Bundled CTL
We present a sound, complete and relatively straightforward tableau method for deciding valid formulas in the propositional… 
2003
2003
On the Logic of TLA+
TLA + is a language intended for the high-level specification of reactive, distributed, and in particular asynchronous systems… 
2000
2000
Verifying Generic Erlang Client-Server Implementations
The Erlang Verification Tool is an interactive theorem prover tailoredto verify properties of distributedsystems implementedin… 
1996
1996
A Machine Verified Distributed Sorting Algorithm
We present a verification of a distributed sorting algorithm in ALF, an implementation of Martin L¨of's type theory. The… 
1992
1992
A Proof Assistant for Symbolic Model-Checking
We describe a prototype of a tool to assist in the model-checking of infinite systems by a tableau-based method. The tool… 
1991
1991
Mechanizing a Proof by Induction of Process Algebrs Specifications in Higher Order Logic
When dealing with inductively defined systems, correctness proofs of different specifications of the same system cannot be… 
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)