Skip to search formSkip to main contentSkip to account menu

Coq (software)

Known as: Coq (proof assistant), COQ, Coq proof assistant 
In computer science, Coq is an interactive theorem prover. It allows the expression of mathematical assertions, mechanically checks proofs of these… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
ALF (proof assistant)AgdaAndrew AppelAutomated reasoning

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
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… 
Highly Cited
2013
Highly Cited
2013
Cycle-accurate information assurance by proof-carrying based signal sensitivity tracing
We propose a new information assurance model which can dynamically track the information flow in circuit designs and hence… 
2009
2009
Practical Tactics for Separation Logic
We present a comprehensive set of tactics that make it practical to use separation logic in a proof assistant. These tactics… 
Review
2008
Review
2008
Computerizing Mathematical Text with MathLang
2006
2006
Combining the Coq Proof Assistant with First - Order Decision Procedures
Method and apparatus for encapsulating radioactive plastic wastes, particularly radioactively contaminated ion exchange filter… 
2002
2002
A Proof Dedicated Meta-Language
2001
2001
Calculational Reasoning Revisited (An Isabelle/Isar Experience)
We discuss the general concept of calculational reasoning within Isabelle/Isar, which provides a framework for high-level natural… 
1999
1999
On the way to certify Computer Algebra Systems
1995
1995
Termination Proof of Term Rewriting System with the Multiset Path Ordering. A Complete Development in the System Coq
We propose a constructive termination proof in the Calculus of Constructions of any finite term rewriting systems whose rules can… 
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)