- Extracting Programs with Exceptions in an Impredicative Type System
- Proving termination using dependent types: the case of xorterms
- Exceptions considered harmless JeanFrancois Monin
- Defending the Bank with a Proof Assistant Judical Courant
- Universit de Paris-Sud CENTRE D'ORSAY
- Defending the Bank with a Proof Assistant Judical Courant 1 and Jean-Franois Monin 1
- Proof pearl: elementary inductive and integer-based proofs about balanced words
- http://www.lsv.ens-cachan.fr/Publis/ In Formal Methods in System Design 22(1):59-86, 2003
- Designing a CPU model: from a pseudo-formal document to fast code F. Blanqui1,2, C. Helmstetter1,2,, V. Joloboff1,2, J.-F. Monin1,3,4 and X. Shi1,4
- Verifying Self-stabilizing Population Protocols with Coq Yuxin Deng and Jean-Francois Monin
- Proving termination using dependent types: the case of xor-terms
- Proof pearl: elementary inductive and integer-based proofs about balanced words
- Correctness Proof of the Standardized Algorithm for ABR Conformance
- Correctness Proof of the Standardized Algorithm for ABR Conformance
- Extracting Programs with Exceptions in an Impredicative Type System
- Proof pearl: from concrete to functional Jean-Fran cois Monin
- Proving a real time algorithm for ATM in Coq Jean-Francois Monin
- Proving a real time algorithm for ATM in Coq JeanFrancois Monin
- Proving the Correctness of the Standardized Algorithm for ABR Conformance
- de recherche ISSN0249-6399ISRNINRIA/RR--7511--FR+ENG
- A Framework for Verifying Data-Centric Protocols
- Exceptions considered harmless Jean-Francois Monin
