Scalable Minimizing-Operators on Polyhedra via Parametric Linear Programming". In: Static analysis (SAS). Ed. by Francesco Ranzato, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01555998
Precise widening operators for convex polyhedra, In: Sci. Comput. Program, vol.58, pp.28-56, 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. ,
Computing Convex Hulls with a Linear Solver, Theory and Practice of Logic Programming 5.1, 2005. ,
Certified Result Checking for Polyhedral Analysis of Bytecode Programs, Trustworthy Global Computing (TGC), vol.6084, p.537816, 2010. ,
URL : https://hal.archives-ouvertes.fr/inria-00537816
A Coq Tactic for Equality Learning in Linear Arithmetic, Interactive Theorem Proving (ITP), vol.10895, pp.108-125, 2018. ,
Refinement to Certify Abstract Interpretations, Illustrated on Linearization for Polyhedra, J. Automated Reasoning, 2018. ,
Toward Certification for Free! Preprint, p.1558252, 2017. ,
Linear Programming. Series of books in the Mathematical Sciences, 1983. ,
Automatic Discovery of Linear Restraints Among Variables of a Program, ACM SIGACT-SIGPLAN Symposium on Principles of programming languages (POPL) ,
, , pp.84-96, 1978.
, Thapa. Linear Programming. Introduction, vol.1, pp.0-387, 1997.
Revisiting the abstract domain of polyhedra : constraintsonly representation and formal proof, p.1286086, 2015. ,
A Certifying Frontend for (Sub)polyhedral Abstract Domains, Verified Software: Theories, Tools and Experiments (VSTTE), vol.8471 ,
, , pp.200-215, 2014.
Efficient Generation of Correctness Certificates for the Abstract Domain of Polyhedra, Static analysis (SAS), 2013. ,
Histoire de l'Académie, partie mathématique (1824)". In: Mémoires de l'Académie des sciences de l, Institut de France, vol.7 ,
Relaxing the Value Restriction, Functional and Logic Programming, 7th International Symposium (FLOPS), vol.2998, pp.196-213, 2004. ,
Université Scientifique et Médicale de Grenoble & Institut National Polytechnique de Grenoble, p.288805, 1979. ,
Some ways to reduce the space dimension in polyhedra computations, Formal Methods in System Design, vol.29, issue.1, pp.79-95, 2006. ,
URL : https://hal.archives-ouvertes.fr/hal-00189633
Apron: a Library of Numerical Abstract Domains for Static Analysis, Computer Aided Verification, 21st International Conference, vol.5643, pp.661-667, 2009. ,
URL : https://hal.archives-ouvertes.fr/hal-00786354
On Polyhedral Projections and Parametric Programming", In: J. Optimization Theory and Applications, vol.138, pp.207-220, 2008. ,
Lexicographic perturbation for multiparametric linear programming with applications to control, Automatica, 2007. ,
Verasco: a Formally Verified C Static Analyzer, 2016. ,
URL : https://hal.archives-ouvertes.fr/tel-01327023
A Formally-Verified C Static Analyzer, Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp.247-259, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01078386
Fourier-Motzkin Elimination Method, Encyclopedia of Optimization. Ed. by Christodoulos A. Floudas and Panos M Pardalos, pp.1074-1076, 2009. ,
Generating All Vertices of a Polyhedron Is Hard, Also as DIMACS TR 2005-21, vol.39, pp.174-190, 2008. ,
Verified static analyzes for low-level languages, Theses. Université Rennes, vol.1, 2015. ,
URL : https://hal.archives-ouvertes.fr/tel-01285624
A note on Chernikova's Algorithm ,
New Algorithmics for Polyhedral Calculus via Parametric Linear Programming. (Nouvelle Algorithmique pour le Calcul Polyédral via Programmation Linéaire Paramétrique)". PhD thesis, p.1695086, 2017. ,
Efficient Elimination of Redundancies in Polyhedra by Raytracing, Verification, Model Checking, and Abstract Interpretation (VMCAI), vol.10145 ,
, , pp.367-385, 2017.
London Mathematical Society lecture note series, Convex polytopes and the upper bound conjecture, vol.3, pp.0-521, 1971. ,
Selected papers, pp.3-7643, 1983. ,
The double description method, Contributions to the theory of games, vol.2, pp.51-74, 1953. ,
Theory of Linear and Integer Programming. Wiley, pp.0-471, 1998. ,
A practical construction for decomposing numerical abstract domains, Proceedings of the ACM on Programming Languages (PACMPL) 2.POPL, vol.55, 2018. ,