Alejandro Aguirre
2016
Towards a provably correct encoding from F* to SMT
https://prosecco.gforge.inria.fr/personal/hritcu/students/alejandro/report.pdf
Michaël Armand
Germain Faure
Benjamin Grégoire
Chantal Keller
Laurent Thery
Benjamin Werner
2011
A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses
First International Conference on Certified Programs and Proofs
10.1007/978-3-642-25379-9_12
Ali Assaf
Guillaume Burel
Raphal Cauderlier
David Delahaye
Gilles Dowek
Catherine Dubois
Frédéric Gilbert
Pierre Halmagrand
Olivier Hermant
Ronan Saillard
2016
Expressing theories in the λΠ-calculus modulo theory and in the Dedukti system
22nd International Conference on Types for Proofs and Programs
https://hal-mines-paristech.archives-ouvertes.fr/hal-01441751
Henk Barendregt
Erik Barendsen
2002
Autarkic computations in formal proofs
Journal of Automated Reasoning
10.1023/A:1015761529444
Frédéric Blanqui
2003
Inductive Types in the Calculus of Algebraic Constructions
Lecture Notes in Computer Science
10.1007/3-540-44904-3_4
François Bobot
Jean-Christophe Filliâtre
Claude Marché
Andrei Paskevich
2015
Let's Verify This with Why3
International Journal on Software Tools for Technology Transfer (STTT)
10.1007/s10009-014-0314-5
François Bobot
Andrei Paskevich
2011
Expressing Polymorphic Types in a Many-Sorted Language
10.1007/978-3-642-24364-6_7
Sascha Böhme
Tjark Weber
2010
Fast LCF-Style Proof Reconstruction for Z3
Interactive Theorem Proving
10.1007/978-3-642-14052-5_14
Raphaël Cauderlier
Pierre Halmagrand
2015
Checking Zenon Modulo Proofs in Dedukti
Proof eXchange for Theorem Proving
10.4204/EPTCS.186.7
Zakaria Chihani
Dale Miller
Fabien Renaud
2013
Checking Foundational Proof Certificates for First-Order Logic (Extended Abstract)
PxTP 2013. Third International Workshop on Proof Exchange for Theorem Proving
10.29007/7gnr
Évelyne Contejean
2008
Coccinelle, a Coq library for rewriting
Types
Denis Cousineau
Gilles Dowek
2007
Embedding Pure Type Systems in the lambda-Pi-calculus modulo
Typed lambda calculi and applications
10.1007/978-3-540-73228-0_9
David Delahaye
2000
A tactic language for the system Coq
International Conference on Logic for Programming Artificial Intelligence and Reasoning
10.1007/3-540-44404-1_7
Jean-Christophe Filliâtre
1999
Preuve de programmes impératifs en théorie des types
http://www.lri.fr/~filliatr/ftp/publis/these.ps.gz
Quentin Garchery
2021
destruct/case transformations incorrectly handle polymorphic formulas
https://gitlab.inria.fr/why3/why3/-/issues/525/
Quentin Garchery
2021
Performance slowdown with variable shadowing
https://github.com/Deducteam/lambdapi/issues/565
Quentin Garchery
2021
Performance with growing context
https://github.com/Deducteam/lambdapi/issues/579
Quentin Garchery
2021
Performances with both new variables and hypotheses in context
https://github.com/Deducteam/lambdapi/issues/595
Quentin Garchery
2021
Performances with linear propositional problem
https://github.com/Deducteam/lambdapi/issues/649
Quentin Garchery
2021
Performances with nested applications in context
https://github.com/Deducteam/lambdapi/issues/584
Quentin Garchery
2021
Why3 cert_pxtp branch
https://gitlab.inria.fr/why3/why3/-/blob/cert_pxtp/README_PXTP.md
Quentin Garchery
Chantal Keller
Claude Marché
Andrei Paskevich
2020
Des transformations logiques passent leur certicat
JFLA 2020 - Journées Francophones des Langages Applicatifs
Gruissan, France
https://hal.inria.fr/hal-02384946
David Greenaway
2015
Automated proof-producing abstraction of C code
CSE, UNSW
http://unsworks.unsw.edu.au/fapi/datastream/unsworks:13743/SOURCE02?view=true
David Greenaway
Japheth Lim
June Andronick
Gerwin Klein
2014
Don't Sweat the Small Stuff: Formal Verification of C Code Without the Pain
ACM SIGPLAN Conference on Programming Language Design and Implementation
10.1145/2594291.2594296
Benjamin Grégoire
Laurent Théry
Benjamin Werner
2006
A Computational Approach to Pocklington Certificates in Type Theory
Functional and Logic Programming
10.1007/11737414_8
Gérard P. Huet
1987
The Calculus of Constructions: State of the Art
Foundations of Software Technology and Theoretical Computer Science
10.1007/3-540-18625-5_61
Robbert Krebbers
Ralf Jung
Aleš Bizjak
Jacques-Henri Jourdan
Derek Dreyer
Lars Birkedal
2017
The Essence of Higher-Order Concurrent Separation Logic
26th European Symposium on Programming Languages and Systems
10.1007/978-3-662-54434-1_26
Stéphane Lescuyer
2011
Formalizing and Implementing a Reflexive Tactic for Automated Deduction in Coq. (Formalisation et developpement d'une tactique reflexive pour la demonstration automatique en coq)
University of Paris-Sud, Orsay, France
https://tel.archives-ouvertes.fr/tel-00713668
Robin Milner
1978
A theory of type polymorphism in programming
Journal of computer and system sciences
10.1016/0022-0000(78)90014-4
Frank Pfenning
Christine Paulin-Mohring
1989
Inductively Defined Types in the Calculus of Constructions
Lecture Notes in Computer Science
10.1007/BFb0040259
Nikhil Swamy
Catalin Hritcu
Chantal Keller
Aseem Rastogi
Antoine Delignat-Lavaud
Simon Forest
Karthikeyan Bhargavan
Cédric Fournet
Pierre-Yves Strub
Markulf Kohlweiss
Jean Karim Zinzindohoue
Santiago Zanella Béguelin
2016
Dependent types and multi-monadic effects in F*
Principles of Programming Languages
10.1145/2837614.2837655