We study satisfiability modulo the theory of finite fields and give a decision procedure for this
theory. We implement our procedure for prime fields inside the cvc5 SMT solver. Using this …

Satisfiability modulo finite fields enables automated verification for cryptosystems.
Unfortunately, previous solvers scale poorly for even some simple systems of field …

Using techniques from the fields of symbolic computation and satisfiability checking we
verify one of the cases used in the landmark result that projective planes of order ten do not …

The geometry automated theorem proving area distinguishes itself by a large number of
specific methods and implementations, different approaches (synthetic, algebraic, semi …

NeutroGeometries generalize geometries in the same way that NeutroAlgebras generalize
universal and partial algebras. NeutroGeometry is not one kind of classical geometry, but it …

Ce travail de thèse s' inscrit dans le domaine de la preuve assistée par ordinateur et se
place d'un point de vue méthodologique. L'objectif premier des assistants de preuves est de …

Projective incidence geometry [9, 6] is one of the simplest description of geometry, where 26
only points and lines as well as their incidence properties are considered. In addition, in 27 …

We study how to formalize in the Coq proof assistant the smallest projective space PG (3, 2).
We then describe formally the spreads and packings of PG (3, 2), as well as some of their …

This paper introduces diagrams in projective geometry as valid proving tools. Al though
diagrams are used to support the understanding of proofs in projective geometry, they are …

La géométrie projective est une approche de la géométrie permettant de capturer les
notions de perspective et d'horizon. En 2D, cela revient à faire l'hypothèse que deux droites …