package coq

  1. Overview
  2. Docs
Formal proof management system

Install

Dune Dependency

Authors

Maintainers

Sources

coq-8.15.0.tar.gz
sha256=73466e61f229b23b4daffdd964be72bd7a110963b9d84bd4a86bb05c5dc19ef3

doc/micromega_plugin/Micromega_plugin/Certificate/index.html

Module Micromega_plugin.CertificateSource

Sourcemodule Mc = Micromega
Sourceval use_simplex : unit -> bool

use_simplex is bound to the Coq option Simplex. If set, use the Simplex method, otherwise use Fourier

Sourcetype ('prf, 'model) res =
  1. | Prf of 'prf
  2. | Model of 'model
  3. | Unknown
Sourcetype zres = (Mc.zArithProof, int * Mc.z list) res
Sourcetype qres = (Mc.q Mc.psatz, int * Mc.q list) res

q_cert_of_pos prf converts a Sos proof into a rational Coq proof

z_cert_of_pos prf converts a Sos proof into an integer Coq proof

Sourceval lia : bool -> int -> (Mc.z Mc.pExpr * Mc.op1) list -> zres

lia enum depth sys generates an unsat proof for the linear constraints in sys. If the Simplex option is set, any failure to find a proof should be considered as a bug.

Sourceval nlia : bool -> int -> (Mc.z Mc.pExpr * Mc.op1) list -> zres

nlia enum depth sys generates an unsat proof for the non-linear constraints in sys. The solver is incomplete -- the problem is undecidable

Sourceval linear_prover_with_cert : int -> (Mc.q Mc.pExpr * Mc.op1) list -> qres

linear_prover_with_cert depth sys generates an unsat proof for the linear constraints in sys. Over the rationals, the solver is complete.

Sourceval nlinear_prover : int -> (Mc.q Mc.pExpr * Mc.op1) list -> qres

nlinear depth sys generates an unsat proof for the non-linear constraints in sys. The solver is incompete -- the problem is decidable.

OCaml

Innovation. Community. Security.