International audienceCoq provides linear arithmetic tactics like omega or lia. Currently, these tactics either fully prove the goal in progress, or fail. We propose to improve this behavior: when the goal is not provable in linear arithmetic, we inject in hypotheses new equalities discovered from the linear inequalities. These equalities may help other Coq tactics to discharge the goal. In other words, we apply – in interactive proofs – one of the seminal idea of SMT-solving: combining tactics by exchanging equalities. The paper describes how we have implemented equality learning in a new Coq tactic, dealing with linear arithmetic over rationals. It also illustrates how this tactic interacts with other Coq tactics
International audienceWe present several new techniques for linear arithmetic constraint solving. Th...
International audienceCoq Modulo Theory (CoqMT) is an extension of the Coq proof assistant incorpora...
International audienceMCSAT is an approach to SMT-solving that uses assignments of values to first-o...
International audienceWe present a new implementation of a reflexive tactic which solves equalities ...
We present rational, a Coq tactic for equational reasoning in abelian groups, commutative rings, and...
In this paper we describe the encoding of linear logic in the Coq system, a proof assistant for high...
Linear arithmetic constraints in the form of equalities and inequalities constitute the vast majorit...
In this thesis, we propose new automation capabilities for the Coq proof assistant. We obtain this m...
This paper presents a new proof tactic that decides equalities and inequalities between terms over ...
We propose a simple theory of monotone functions that is the basis for the implementation of a tacti...
International audienceThe λ-calculus is a handy formalism to specify the evaluation of higher-order ...
A well-known challenge in leveraging automatic theorem provers, such as satisfiability modulo theori...
[[abstract]]The Equality Axioms in this study mean “If equals be added to equals, the wholes are equ...
In this paper we present a new decision procedure for the satisfiability of Linear Arithmetic Logic ...
International audienceWe present several new techniques for linear arithmetic constraint solving. Th...
International audienceCoq Modulo Theory (CoqMT) is an extension of the Coq proof assistant incorpora...
International audienceMCSAT is an approach to SMT-solving that uses assignments of values to first-o...
International audienceWe present a new implementation of a reflexive tactic which solves equalities ...
We present rational, a Coq tactic for equational reasoning in abelian groups, commutative rings, and...
In this paper we describe the encoding of linear logic in the Coq system, a proof assistant for high...
Linear arithmetic constraints in the form of equalities and inequalities constitute the vast majorit...
In this thesis, we propose new automation capabilities for the Coq proof assistant. We obtain this m...
This paper presents a new proof tactic that decides equalities and inequalities between terms over ...
We propose a simple theory of monotone functions that is the basis for the implementation of a tacti...
International audienceThe λ-calculus is a handy formalism to specify the evaluation of higher-order ...
A well-known challenge in leveraging automatic theorem provers, such as satisfiability modulo theori...
[[abstract]]The Equality Axioms in this study mean “If equals be added to equals, the wholes are equ...
In this paper we present a new decision procedure for the satisfiability of Linear Arithmetic Logic ...
International audienceWe present several new techniques for linear arithmetic constraint solving. Th...
International audienceCoq Modulo Theory (CoqMT) is an extension of the Coq proof assistant incorpora...
International audienceMCSAT is an approach to SMT-solving that uses assignments of values to first-o...