Rocq in the context of Automated theorem prover

Rocq in the context of Automated theorem prover

Rocq Study page number 1 of 1

Play TriviaQuestions Online!

 or

Skip to study material about Rocq in the context of "Automated theorem prover"

⭐ Core Definition: Rocq

The Rocq Prover (formerly named Coq) is an interactive theorem prover first released in 1989. It allows the expression of mathematical assertions, mechanical checking of proofs of these assertions, assists in finding formal proofs using proof automation routines and extraction of a certified program from the constructive proof of its formal specification.

Rocq works within the theory of the calculus of inductive constructions, a derivative of the calculus of constructions. Rocq is not an automated theorem prover but includes automatic theorem proving tactics (procedures) and various decision procedures.

↓ Menu
HINT:

In this Dossier

Rocq in the context of CompCert

CompCert is a formally verified optimizing compiler for a large subset of the C99 programming language (known as Clight) which currently targets PowerPC, ARM, RISC-V, x86 and x86-64 architectures. This project, led by Xavier Leroy, started officially in 2005, funded by the French institutes ANR and INRIA. The compiler is specified, programmed and proven in the Rocq proof assistant. It aims to be used for programming embedded systems requiring reliability. The performance of its generated code is often close to that of GCC (version 3) at optimization level -O1, and always better than that of GCC without optimizations.

Since 2015, AbsInt offers commercial licenses, provides support and maintenance, and contributes to the advancement of the tool. CompCert is released under a noncommercial license, and is therefore not free software, although some of its source files are dual-licensed with the GNU Lesser General Public License version 2.1 or later or are available under the terms of other licenses.

View the full Wikipedia page for CompCert
↑ Return to Menu
LINKED FROM (PARENTS)
← CompCert
LINKS TO (CHILDREN)
Proof assistant → Formal proof → Constructive proof → Formal specification → Calculus of constructions → Automated theorem prover → Subroutine → Decidability (logic) →