International audienceWe present the development of a machine-checked implementation of Stalmarck's algorithm. First, we prove the correctness and the completeness of an abstract representation of the algorithm. Then, we give an effective implementation of the algorithm that we prove correct
International audienceEnjoying the power of SAT and SMT solvers in the Coq proof as- sistant without...
International audienceA compiler consists of a sequence of phases going from lexical analysis to cod...
International audienceThis extended abstract is about an effort to build a formal description of a t...
Abstract. We present the development of a machine-checked implemen-tation of Stalmarck's algori...
International audienceEmerging trends in proof styles and new applications of interactive proof assi...
International audienceComparing provers on a formalization of the same problem is always a valuable ...
International audienceWe describe a step-by-step approach to the implementation and formal verificat...
International audienceThe Coq Platform is a continuously developed distribution of the Coq proof ass...
International audienceCoq [1] is a proof assistant which relies on the Curry-Howard isomorphism to c...
Basing on an original Coq implementation of unbounded linear search for partially decidable predicat...
International audienceIn mathematics, it is common practice to have several constructionsfor the sam...
National audienceWe consider a recent publication on higher-order process calculi and describe how i...
International audienceThis article tackles Kahan's algorithm to compute accurately the discriminant ...
The system Coq (Dowek et al., 1991) is an environment for proof development based on the Calculus of...
International audienceProving programs correct is hard. During the last decades computer scientists ...
International audienceEnjoying the power of SAT and SMT solvers in the Coq proof as- sistant without...
International audienceA compiler consists of a sequence of phases going from lexical analysis to cod...
International audienceThis extended abstract is about an effort to build a formal description of a t...
Abstract. We present the development of a machine-checked implemen-tation of Stalmarck's algori...
International audienceEmerging trends in proof styles and new applications of interactive proof assi...
International audienceComparing provers on a formalization of the same problem is always a valuable ...
International audienceWe describe a step-by-step approach to the implementation and formal verificat...
International audienceThe Coq Platform is a continuously developed distribution of the Coq proof ass...
International audienceCoq [1] is a proof assistant which relies on the Curry-Howard isomorphism to c...
Basing on an original Coq implementation of unbounded linear search for partially decidable predicat...
International audienceIn mathematics, it is common practice to have several constructionsfor the sam...
National audienceWe consider a recent publication on higher-order process calculi and describe how i...
International audienceThis article tackles Kahan's algorithm to compute accurately the discriminant ...
The system Coq (Dowek et al., 1991) is an environment for proof development based on the Calculus of...
International audienceProving programs correct is hard. During the last decades computer scientists ...
International audienceEnjoying the power of SAT and SMT solvers in the Coq proof as- sistant without...
International audienceA compiler consists of a sequence of phases going from lexical analysis to cod...
International audienceThis extended abstract is about an effort to build a formal description of a t...