A stratified semantics of general references embeddable in higher-order logic, Symposium on Logic in Computer Science (LICS), p.75, 2002. ,
A very modal model of a modern, major, general type system, Principles of Programming Languages (POPL), pp.109-122, 2007. ,
URL : https://hal.archives-ouvertes.fr/hal-00150978
Extending coq with imperative features and its application to SAT verification, Interactive Theorem Proving (ITP), vol.6172, pp.83-98, 2010. ,
URL : https://hal.archives-ouvertes.fr/inria-00502496
A modular integration of SAT/SMT solvers to coq through proof witnesses, Certified Programs and Proofs, vol.7086, pp.135-150, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00639130
Generation of Basic Semialgebraic Invariants Using Convex Polyhedra, pp.19-34, 2005. ,
The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems, Science of Computer Programming, vol.72, issue.1-2, pp.3-21, 2008. ,
Autarkic computations in formal proofs, Journal of Automated Reasoning, vol.28, issue.3, pp.321-336, 2002. ,
The Satisfiability Modulo Theories Library (SMT-LIB), 2010. ,
Formally verified optimizing compilation in ACG-based flight control software, Embedded Real Time Software and Systems (ERTS2), 2012. ,
Reachability Analysis of Polynomial Systems Using Linear Programming Relaxations, pp.137-151 ,
URL : https://hal.archives-ouvertes.fr/hal-00769672
, , 2012.
Linear relaxations of polynomial positivity for polynomial lyapunov function synthesis, IMA Journal of Mathematical Control and Information, vol.33, issue.3, pp.723-756, 2015. ,
Computing convex hulls with a linear solver, Theory and Practice of Logic Programming, vol.5, issue.1-2, 2005. ,
Type-theory in color, International Conference on Functional Programming (ICFP), ICFP '13, pp.61-72, 2013. ,
A computational interpretation of parametricity, Symposium on Logic in Computer Science (LICS), LICS '12, pp.135-144, 2012. ,
Interactive Theorem Proving and Program Development, Texts in Theoretical Computer Science. An EATCS Series, 2004. ,
URL : https://hal.archives-ouvertes.fr/hal-00344237
Fast reflexive arithmetic tactics the linear case and beyond, Types for Proofs and Programs (TYPES), vol.4502, pp.48-62, 2006. ,
Result certification for relational program analysis, 2007. ,
URL : https://hal.archives-ouvertes.fr/inria-00166930
Certified result checking for polyhedral analysis of bytecode programs, Trustworthy Global Computing (TGC), vol.6084, pp.253-267, 2010. ,
URL : https://hal.archives-ouvertes.fr/inria-00537816
Modular SMT proofs for fast reflexive checking inside coq, Certified Programs and Proofs (CPP), vol.7086, pp.151-166, 2011. ,
URL : https://hal.archives-ouvertes.fr/hal-00646960
Step-indexed kripke models over recursive worlds, Principles of Programming Languages (POPL), pp.119-132, 2011. ,
Extending sledgehammer with SMT solvers, Journal of Automated Reasoning, vol.51, issue.1, pp.109-128, 2013. ,
New finite pivoting rules for the simplex method, Mathematics of Operations Research, vol.2, pp.103-107, 1977. ,
Validating dominator trees for a fast, verified dominance test, Interactive Theorem Proving (ITP), vol.9236, pp.84-99, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01193281
Certifying compilers using higher-order theorem provers as certificate checkers. Formal Methods in System Design, vol.38, pp.33-61, 2011. ,
Sledgehammer: Judgement day, International Joint Conference on Automated Reasoning (IJCAR), vol.6173, pp.107-121, 2010. ,
Bounding Variable Values and Round-Off Effects Using Handelman Representations, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol.30, issue.11, pp.1691-1704, 2011. ,
Refinement to certify abstract interpretations, illustrated on linearization for polyhedra, Interactive Theorem Proving (ITP), vol.9236, pp.100-116, 2015. ,
Toward Certification for Free! preprint, 2017. ,
A Coq Tactic for Equality Learning in Linear Arithmetic, 2017. ,
Convex Optimization, 2004. ,
Interval polyhedra: An abstract domain to infer interval linear relationships, Static Analysis Symposium (SAS), pp.309-325, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-00531564
Algorithm for discovering the set of all the solutions of a linear programming problem, USSR Computational Mathematics and Mathematical Physics, 1968. ,
Sollya: An environment for the development of numerical codes, International Congress on Mathematical Software (ICMS), vol.6327, pp.28-31, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-00761644
Certified and fast computation of supremum norms of approximation errors, Computer Arithmetic (ARITH), pp.169-176, 2009. ,
Certified Programming with Dependent Types: A Pragmatic Introduction to the Coq Proof Assistant, 2013. ,
Linear Programming. Series of books in the Mathematical Sciences, 1983. ,
Symbolic polynomial maximization over convex sets and its application to memory requirement estimation. Transactions on Very Large Scale Integration (VLSI) Systems, vol.17, pp.983-996, 2009. ,
URL : https://hal.archives-ouvertes.fr/inria-00504617
, , 1998.
SMT-RAT: An SMTCompliant Nonlinear Real Arithmetic Toolbox, Theory and Applications of Satisfiability Testing (SAT), vol.7317, pp.442-448, 2012. ,
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, Principles of Programming Languages (POPL), pp.238-252, 1977. ,
The mathematical language AUTOMATH, its usage, and some of its extensions, Symposium on Automatic Demonstration, vol.125, pp.29-61, 1968. ,
Z3: An Efficient SMT Solver, Tools and Algorihtms for the Construction and Analysis of Systems (TACAS), vol.4963, pp.337-340, 2008. ,
A model-constructing satisfiability calculus, Verification, Model Checking, and Abstract Interpretation (VMCAI), vol.7737, pp.1-12, 2013. ,
A tour of ???4: How it works, and how to use it, Formal Methods in Computer-Aided Design (FMCAD), FMCAD '14, vol.4, pp.7-11, 2014. ,
Yices 2.2, Computer Aided Verification (CAV), vol.8559, pp.737-744, 2014. ,
Integrating simplex with ????(?), 2006. ,
A fast linear-arithmetic solver for ????(?), Computer Aided Verification (CAV), vol.4144, pp.81-94, 2006. ,
Theorie der einfachen ungleichungen, Journal für die reine und angewandte Mathematik, vol.124, pp.1-27, 1902. ,
The Bernstein polynomial basis: A centennial retrospective, Computer Aided Geometric Design, vol.29, issue.6, pp.379-419, 2012. ,
Parametric integer programming, vol.22, pp.243-268, 1988. ,
Automatic parallelization in the polytope model, pp.79-103, 1996. ,
Revisiting the abstract domain of polyhedra: constraints-only representation and formal proof, 2015. ,
A certifying frontend for (sub)polyhedral abstract domains, Verified Software: Theories, Tools, Experiments (VSTTE), vol.8471, pp.200-215, 2014. ,
Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra, Static Analysis Symposium (SAS), vol.7935, pp.345-365, 2013. ,
How hard is it to verify that an H-polyhedron and a V-polyhedron are equal?, 2004. ,
, , 2016.
Double description method revisited, Combinatorics and Computer Science, pp.91-111, 1996. ,
Multiparametric linear programming, Management Science, vol.18, issue.7, pp.406-422, 1972. ,
????(?): Fast decision procedures, Computer Aided Verification (CAV), vol.3114, pp.175-188, 2004. ,
Relaxing the value restriction, Asian Programming Languages and Systems Symposium (APLAS), volume 2998 of LNCS, pp.31-45, 2002. ,
Polyhedral convex cones, Linear inequalities and related systems, vol.38, pp.19-40, 1956. ,
A metalanguage for interactive proof in LCF, Principles of Programming Languages (POPL), pp.119-130, 1978. ,
, Edinburgh LCF, 1979.
Proving equalities in a commutative ring done right in Coq, Theorem Proving in Higher Order Logics (TPHOL), vol.3603, pp.98-113, 2005. ,
Proof certificates for algebra and their application to automatic geometry theorem proving, Automated Deduction in Geometry (ADG), vol.6301, 2008. ,
Détermination automatique de relations linéaires vérifiées par les variables d'un programme, 1979. ,
Representing polynomials by positive linear functions on compact convex polyhedra, Pacific Journal of Mathematics, vol.132, issue.1, pp.35-62, 1988. ,
A skeptic's approach to combining HOL and maple, Journal of Automated Reasoning, vol.21, issue.3, pp.279-294, 1998. ,
Polyhedral analysis using parametric objectives, Static Analysis Symposium (SAS), vol.7460, pp.41-57, 2012. ,
Apron: A library of numerical abstract domains for static analysis, Computer Aided Verification (CAV), 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-00786354
On polyhedral projections and parametric programming, Journal of Optimization Theory and Applications, vol.138, issue.2, pp.207-220, 2008. ,
Lexicographic perturbation for multiparametric linear programming with applications to control, Automatica, vol.43, issue.10, pp.1808-1816, 2007. ,
A formally-verified C static analyzer, Principles of Programming Languages (POPL), pp.247-259, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01078386
Solving non-linear arithmetic, International Joint Conference on Automated Reasoning (IJCAR), vol.7364, pp.339-354 ,
, , 2012.
Extended resolution as certificates for propositional logic, Proof Exchange for Theorem Proving, vol.14, pp.96-109, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00836845
rasat: SMT for polynomial inequality, Satisfiability Modulo Theories (SMT), p.67, 2014. ,
Journal d'analyse mathématique, vol.12, pp.307-326, 1964. ,
of Imperial College Optimization Series, Moments, Positive Polynomials and Their Applications, vol.1, 2010. ,
Simplification and elimination of redundant linear arithmetic constraints, Constraint Logic Programming, pp.73-87, 1993. ,
A Note on Chernikova's algorithm, INRIA, 1992. ,
Formal verification of a realistic compiler, Communications of the ACM, vol.52, issue.7, pp.107-115, 2009. ,
URL : https://hal.archives-ouvertes.fr/inria-00415861
, , 2010.
Formal proofs for nonlinear optimization, Journal of Formalized Reasoning, vol.8, issue.1, pp.1-24, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-00985675
, GNU Linear Programming Kit, 2000.
Efficient elimination of redundancies in polyhedra by raytracing, Verification, Model Checking, and Abstract Interpretation (VMCAI), volume 10145 of LNCS, pp.367-385, 2017. ,
Polyhedral approximation of multivariate polynomials using Handelman's theorem, Verification, Model Checking, and Abstract Interpretation (VMCAI), pp.166-184, 2016. ,
Scalable minimizing-operators on polyhedra via parametric linear programming, Static Analysis Symposium (SAS), vol.10422, 2017. ,
The maximum numbers of faces of a convex polytope, Mathematika, vol.17, pp.179-184, 1970. ,
Convex polytopes and the upper bound conjecture, London Mathematical Society Lecture Note Series, vol.3, 1971. ,
Symbolic methods to enhance the precision of numerical abstract domains, Verification, Model Checking, and Abstract Interpretation (VMCAI), vol.3855, pp.348-363, 2006. ,
The octagon abstract domain. Higher-Order and Symbolic Computation, vol.19, pp.31-100, 2006. ,
Quantifier elimination by lazy model enumeration, Computer Aided Verification (CAV), vol.6174, pp.585-599, 2010. ,
URL : https://hal.archives-ouvertes.fr/hal-00472831
The double description method, Contributions to the Theory of Games, vol.2, pp.51-74, 1953. ,
Formalization of a representation of Bernstein polynomials and applications to global optimization, Journal of Automated Reasoning, vol.51, issue.2, pp.151-196, 2013. ,
Proof-carrying code, Principles of Programming Languages (POPL), pp.106-119, 1997. ,
A Quest for Exactness: Program Transformation for Reliable Real Numbers, 2013. ,
, Complexity, convexity and combinations of theories. Theor. Comput. Sci, vol.12, pp.291-302, 1980.
A constraint solver based on abstract domains, Verification, Model Checking, and Abstract Interpretation (VMCAI), vol.7737, pp.434-454, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00785604
Certified functional programming : Program extraction within Coq proof assistant, 2004. ,
URL : https://hal.archives-ouvertes.fr/tel-00150912
Extraction in Coq: An Overview, Computability in Europe (CiE), vol.5028, pp.359-369, 2008. ,
URL : https://hal.archives-ouvertes.fr/hal-00338973
Positive Polynomials: From Hilbert's 17th Problem to Real Algebra, 2001. ,
A matrix method for efficient computation of bernstein coefficients, Reliable Computing, vol.17, issue.1, pp.40-71, 2012. ,
Robust explicit model predictive control via regular piecewise-affine approximation, International Journal of Control, vol.87, issue.12, pp.2583-2593, 2014. ,
An algorithmic approach to Schmüdgen's Positivstellensatz, Journal of Pure and Applied Algebra, vol.166, issue.3, pp.307-319, 2002. ,
Deciding combinations of theories, Journal of the ACM, vol.31, issue.1, pp.1-12, 1984. ,
Conflict-driven clause learning SAT solvers, Handbook of Satisfiability, vol.185, pp.131-153, 2009. ,
Exploiting sparsity in polyhedral analysis, Static Analysis Symposium (SAS), vol.3672, pp.336-351, 2005. ,
Making numerical program analysis fast, Programming Language Design and Implementation (PLDI)), pp.303-313, 2015. ,
Fast polyhedra abstract domain, Principles of Programming Languages (POPL), pp.46-59, 2017. ,
Starexec: a cross-community infrastructure for logic solving, International Joint Conference on Automated Reasoning (IJCAR), LNIA, 2014. ,
, The Coq Development Team. The Coq proof assistant reference manual -version 8.6. INRIA, 2016.
Formal verification of translation validators: a case study on instruction scheduling optimizations, Principles of Programming Languages (POPL), pp.17-27, 2008. ,
URL : https://hal.archives-ouvertes.fr/inria-00289540
Theorems for free! In Functional Programming Languages and Computer Architecture (FPCA), pp.347-359, 1989. ,
Drat-trim: Efficient checking and trimming using expressive clausal proofs, Theory and Applications of Satisfiability Testing (SAT), vol.8561, pp.422-429, 2014. ,
A library for doing polyhedral operations, 1993. ,
, Simple imperative polymorphism. Lisp and Symbolic Computation, vol.8, pp.343-355, 1995.
Finding and understanding bugs in C compilers, Programming Language Design and Implementation (PLDI)), pp.283-294, 2011. ,
New modification of the double description method for constructing the skeleton of a polyhedral cone, Computational Mathematics and Mathematical Physics, vol.52, issue.1, pp.146-156, 2012. ,