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.
Highly Cited
2016
Highly Cited
2016
Globular: an online proof assistant for higher-dimensional rewriting
This article introduces Globular, an online proof assistant for the formalization and verification of proofs in higher… 
Review
2015
Review
2015
Quantomatic: A proof assistant for diagrammatic reasoning
Monoidal algebraic structures consist of operations that can have multiple outputs as well as multiple inputs, which have… 
Review
2014
Review
2014
Tools and Algorithms for the Construction and Analysis of Systems
Of special interest in formal verification are safety properties, which assert that the system always stays within some allowed… 
Highly Cited
2010
Highly Cited
2010
Superhuman performance of surgical tasks by robots using iterative learning from human-guided demonstrations
In the future, robotic surgical assistants may assist surgeons by performing specific subtasks such as retraction and suturing to… 
Highly Cited
2007
Highly Cited
2007
Cost Analysis of Java Bytecode
Cost analysis of Java bytecode is complicated by its unstructured control flow, the use of an operand stack and its object… 
Highly Cited
2005
Highly Cited
2005
Another Look at "Provable Security"
AbstractWe give an informal analysis and critique of several typical "provable security" results. In some cases there are… 
Highly Cited
2004
Highly Cited
2004
Multi-prover Verification of C Programs
Our goal is the verification of C programs at the source code level using formal proof tools. Programs are specified using… 
Highly Cited
2001
Highly Cited
2001
Automatic Deductive Verification with Invisible Invariants
The paper presents a method for the automatic verification of a certain class of parameterized systems. These are bounded-data… 
Highly Cited
2001
Highly Cited
2001
Parameterized Verification with Automatically Computed Inductive Assertions
The paper presents a method, called the method of verification by invisible invariants, for the automatic verification of a large… 
Highly Cited
1999
Highly Cited
1999
Verification of Infinite State Systems by Compositional Model Checking
A method of compositional verification is presented that uses the combination of temporal case splitting and data type reductions… 
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)