Refinement calculus-a systematic introduction. Graduate texts in computer science, 1999. ,
Certified result checking for polyhedral analysis of bytecode programs, pp.253-267, 2010. ,
URL : https://hal.archives-ouvertes.fr/inria-00537816
Intuitionistic Refinement Calculus, TLCA, LNCS, vol.4583, 2007. ,
What is the Foreign Function Interface of the Coq Programming Language? Talk at the Coq Workshop, 2018. ,
Refinement to Certify Abstract Interpretations, Illustrated on Linearization for Polyhedra, ITP, LNCS, vol.9236, 2015. ,
Toward Certification for Free! Preprint on, 2017. ,
Deciding Kleene Algebras in Coq, Logical Methods in Computer Science, vol.8, issue.1, 2012. ,
URL : https://hal.archives-ouvertes.fr/hal-00383070
Constructive design of a hierarchy of semantics of a transition system by abstract interpretation, TCS, vol.277, issue.1-2, 2002. ,
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, 1977. ,
Automatic discovery of linear restraints among variables of a program, 1978. ,
Guarded commands, nondeterminacy and formal derivation of programs, Commun. ACM, vol.18, issue.8, pp.453-457, 1975. ,
The Bernstein polynomial basis: A centennial retrospective, Computer Aided Geometric Design, vol.29, issue.6, 2012. ,
A certifying frontend for (sub)polyhedral abstract domains, VSTTE, LNCS, vol.8471, 2014. ,
Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra, In: SAS, vol.7935, 2013. ,
Proving equalities in a commutative ring done right in Coq, TPHOL, LNCS, vol.3603, pp.98-113, 2005. ,
Representing polynomials by positive linear functions on compact convex polyhedra, Pacific Journal of Mathematics, vol.132, issue.1, 1988. ,
DOI : 10.2140/pjm.1988.132.35
, Verasco: a Formally Verified C Static Analyzer. Theses, 2016.
URL : https://hal.archives-ouvertes.fr/tel-01327023
A formally-verified C static analyzer, 2015. ,
DOI : 10.1145/2775051.2676966
URL : https://hal.archives-ouvertes.fr/hal-01078386
Verified static analyzes for low-level languages, Theses, Université Rennes, vol.1, 2015. ,
URL : https://hal.archives-ouvertes.fr/tel-01285624
Formal verification of a realistic compiler, Communications of the ACM, vol.52, issue.7, 2009. ,
URL : https://hal.archives-ouvertes.fr/inria-00415861
Modular denotational semantics for compiler construction, ESOP, vol.1058, pp.219-234, 1996. ,
DOI : 10.1007/3-540-61055-3_39
URL : https://link.springer.com/content/pdf/10.1007%2F3-540-61055-3_39.pdf
New algorithmics for polyhedral calculus via parametric linear programm ing, 2017. ,
Polyhedral approximation of multivariate polynomials using Handelman's theorem, pp.166-184, 2016. ,
Three linearization techniques for multivariate polynomials in static analysis using convex polyhedra, 2014. ,
Trace partitioning in abstract interpretation based static analyzers, ESOP'05, vol.3444, 2005. ,
Symbolic methods to enhance the precision of numerical abstract domains, VMCAI, LNCS, vol.3855, 2006. ,
Prentice Hall International series in computer science, 1994. ,
, Affine arithmetic and applications to real-number proving. In: ITP, LNCS, vol.9236, 2015.
The discoveries of continuations, Lisp and Symbolic Computation, vol.6, issue.3-4, 1993. ,
Abstract interpretation as anti-refinement, 2013. ,
, The Coq Development Team: The Coq proof assistant reference manual-version 8
Monads for functional programming, AFP, LNCS, vol.925, 1995. ,