Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
We present a new, completely redesigned, version of F*, a language that works both as a proof assistant as well as a general… Expand
  • figure 3
  • figure 5
Highly Cited
2013
Highly Cited
2013
The technology of mechanized program verification can play a supporting role in many kinds of research projects in computer… Expand
Highly Cited
2012
Highly Cited
2012
Configuration changes are a common source of instability in networks, leading to outages, performance disruptions, and security… Expand
  • table 1
  • figure 1
  • figure 2
  • table 2
Highly Cited
2009
Highly Cited
2009
As cryptographic proofs have become essentially unverifiable, cryptographers have argued in favor of developing techniques that… Expand
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 2.1
  • figure 2.2
Highly Cited
2004
Highly Cited
2004
ion makes it possible to build non-recursive functions directly inside Calculus of Constructions terms, without giving a name to… Expand
  • figure 2.1
  • figure 3.1
  • figure 3.3
  • figure 4.1
  • figure 4.2
Highly Cited
2004
Highly Cited
2004
Abstract We describe the basic structure of an environment for proving Java programs annotated with JML specifications. Our… Expand
  • figure 1
Highly Cited
2000
Highly Cited
2000
 
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 2.3
  • figure 2.4
Highly Cited
1995
Highly Cited
1995
The terms of the simply-typed λ-calculus can be used to express the higher-order abstract syntax of objects such as logical… Expand
Highly Cited
1993
Highly Cited
1993
In the pure Calculus of Constructions, it is possible to represent data structures and predicates using higher-order… Expand