Add to ORKGThis paper presents a new proof tactic that decides equalities and inequalities between terms over lattices. It uses a decision procedure that is a variation on Whitman’s algorithm and is implemented using a technique known as proof by reflection. We will paint the essence of the approach in broad strokes and discuss the use of certified functional programs to aid the automation of formal reasoning
The Coq system is a proof assistant based on the Calculus of InductiveConstructions. In this work, w...
Modern satisfiability solvers implement an algorithm, called Conflict Driven Clause Learning, which ...
We present rational, a Coq tactic for equational reasoning in abelian groups, commutative rings, and...
This paper presents a new proof tactic that decides equalities and inequalities between terms over ...
International audienceWe present a new implementation of a reflexive tactic which solves equalities ...
We describe a method for building composable and extensible ver-ification procedures within the Coq ...
We modify the reflection method to enable it to deal with partial functions like division. The idea ...
Decision procedures are automated theorem proving algorithms which automatically recognize the theor...
International audienceCoq provides linear arithmetic tactics like omega or lia. Currently, these tac...
A constraint-based data ow analysis is formalised in the specication language of the Coq proof assi...
Computational reflection allows us to turn verified decision procedures into efficient automated rea...
National audienceLarge scale reflection tactics are often implemented with ad-hoc data-structures an...
We formalise natural deduction for first-order logic in the proof assistant Coq, using De Bruijn in...
In this thesis, we propose new automation capabilities for the Coq proof assistant. We obtain this m...
Modern satisfiability solvers implement an algorithm, called Con-flict Driven Clause Learning, which...
The Coq system is a proof assistant based on the Calculus of InductiveConstructions. In this work, w...
Modern satisfiability solvers implement an algorithm, called Conflict Driven Clause Learning, which ...
We present rational, a Coq tactic for equational reasoning in abelian groups, commutative rings, and...
This paper presents a new proof tactic that decides equalities and inequalities between terms over ...
International audienceWe present a new implementation of a reflexive tactic which solves equalities ...
We describe a method for building composable and extensible ver-ification procedures within the Coq ...
We modify the reflection method to enable it to deal with partial functions like division. The idea ...
Decision procedures are automated theorem proving algorithms which automatically recognize the theor...
International audienceCoq provides linear arithmetic tactics like omega or lia. Currently, these tac...
A constraint-based data ow analysis is formalised in the specication language of the Coq proof assi...
Computational reflection allows us to turn verified decision procedures into efficient automated rea...
National audienceLarge scale reflection tactics are often implemented with ad-hoc data-structures an...
We formalise natural deduction for first-order logic in the proof assistant Coq, using De Bruijn in...
In this thesis, we propose new automation capabilities for the Coq proof assistant. We obtain this m...
Modern satisfiability solvers implement an algorithm, called Con-flict Driven Clause Learning, which...
The Coq system is a proof assistant based on the Calculus of InductiveConstructions. In this work, w...
Modern satisfiability solvers implement an algorithm, called Conflict Driven Clause Learning, which ...
We present rational, a Coq tactic for equational reasoning in abelian groups, commutative rings, and...