Add to ORKGAbstract. We present the development of a machine-checked implemen-tation of Stalmarck's algorithm. First, we prove the correctness and the completeness of an abstract representation of the algorithm. Then, we give an eective implementation of the algorithm that we prove correct.
The system Coq (Dowek et al., 1991) is an environment for proof development based on the Calculus of...
In this thesis, we propose new automation capabilities for the Coq proof assistant. We obtain this m...
National audienceDespite their wide use and the maturity of their theory, only a few works have focu...
International audienceWe present the development of a machine-checked implementation of Stalmarck's ...
This report describes the implementation of a mechanisation of the theory of computation in the Coq ...
International audienceFloating-point arithmetic is ubiquitous in modern computing, as it is the tool...
International audienceBasing on an original Coq implementation of unbounded linear search for partia...
A handbook to the Coq software for writing and checking mathematical proofs, with a practical engine...
International audienceThe unification algorithm is at the heart of a proof assistant like Coq. In pa...
The paper presents a formal proof of a machine closed theorem of TLA+ in the theorem proving system ...
Abstract. The research in this proposal is aimed at creating a theo-rem proving framework that will ...
Computer-aided formalization of mathematics has progressed in the last decade with the formalization...
Comparing provers on a formalization of the same problem is always a valuable exercise. In this pape...
The paper describes the implementation of interactive ML-style modules in the recent version 7.4 of...
It is well known that mathematical proofs often contain (abstract) algorithms, but although these al...
The system Coq (Dowek et al., 1991) is an environment for proof development based on the Calculus of...
In this thesis, we propose new automation capabilities for the Coq proof assistant. We obtain this m...
National audienceDespite their wide use and the maturity of their theory, only a few works have focu...
International audienceWe present the development of a machine-checked implementation of Stalmarck's ...
This report describes the implementation of a mechanisation of the theory of computation in the Coq ...
International audienceFloating-point arithmetic is ubiquitous in modern computing, as it is the tool...
International audienceBasing on an original Coq implementation of unbounded linear search for partia...
A handbook to the Coq software for writing and checking mathematical proofs, with a practical engine...
International audienceThe unification algorithm is at the heart of a proof assistant like Coq. In pa...
The paper presents a formal proof of a machine closed theorem of TLA+ in the theorem proving system ...
Abstract. The research in this proposal is aimed at creating a theo-rem proving framework that will ...
Computer-aided formalization of mathematics has progressed in the last decade with the formalization...
Comparing provers on a formalization of the same problem is always a valuable exercise. In this pape...
The paper describes the implementation of interactive ML-style modules in the recent version 7.4 of...
It is well known that mathematical proofs often contain (abstract) algorithms, but although these al...
The system Coq (Dowek et al., 1991) is an environment for proof development based on the Calculus of...
In this thesis, we propose new automation capabilities for the Coq proof assistant. We obtain this m...
National audienceDespite their wide use and the maturity of their theory, only a few works have focu...