Get started
Author

Assia Mahboubi

Observed names: ASSIA MAHBOUBI, Butterflies Assia Mahboubi, MAHBOUBI, Assia, Mahboubi Assia, Mahboubi, Assia, Mahboubi, Assia; INRIA Microsoft Research Joint Centre
Institutions: École Centrale de Nantes, Centre National de la Recherche Scientifique, Institut national de recherche en sciences et technologies du numérique, Laboratoire des Sciences du Numérique de Nantes, Centre Inria de l'Université de Lorraine, GALLINETTE: Gallinette : vers une nouvelle génération d'assistant à la preuve, Vrije Universiteit Amsterdam, Nantes Université
Observed institutions: École Centrale de Nantes, École Normale Supérieure de Lyon, Microsoft (United States), Centre National de la Recherche Scientifique, Institut national de recherche en sciences et technologies du numérique, École Polytechnique, Centre Inria d'Université Côte d'Azur, Laboratoire des Sciences du Numérique de Nantes, Centre Inria de Saclay, Centre Inria de l'Université de Lorraine, Centre Inria de l'Université de Rennes, Laboratoire d'Informatique de l'École Polytechnique, Microsoft (France), GALLINETTE: Gallinette : vers une nouvelle génération d'assistant à la preuve, Université de Nantes, Vrije Universiteit Amsterdam, Nantes Université
ORCID: 0000-0002-0312-5461
Observed ORCID: 0000-0002-0312-5461
OpenAlex ID: A5113674451
A Machine-Checked Proof of the Odd Order Theorem
2013 · Georges Gonthier, Andrea Asperti, et al. · Lecture notes in computer science · 295
A Small Scale Reflection Extension for the Coq system
2008 · Georges Gonthier, Assia Mahboubi, et al. · HAL (Le Centre pour la Communication Scientifique Directe) · 146
Packaging Mathematical Structures
2009 · François Garillot, Georges Gonthier, et al. · Lecture notes in computer science · 130
Proving Equalities in a Commutative Ring Done Right in Coq
2005 · Benjamin Grégoire, Assia Mahboubi · Lecture notes in computer science · 102
An introduction to small scale reflection in Coq
2010 · Gonthier, Georges; Microsoft Research Cambridge-INRIA Microsoft Research Joint Centre, Mahboubi, Assia; INRIA Microsoft Research Joint Centre · 98
A Modular Formalisation of Finite Group Theory
2007 · Georges Gonthier, Assia Mahboubi, et al. · Lecture notes in computer science · 54
PDF
Canonical Structures for the Working Coq User
2013 · Assia Mahboubi, Enrico Tassi · Lecture notes in computer science · 47
Formal proofs in real algebraic geometry: from ordered fields to quantifier elimination
2012 · Assia Mahboubi, Cyril Cohen · Logical Methods in Computer Science · 46
PDF
Implementing the cylindrical algebraic decomposition within the Coq system
2007 · ASSIA MAHBOUBI · Mathematical Structures in Computer Science · 26
Competing Inheritance Paths in Dependent Type Theory: A Case Study in Functional Analysis
2020 · Reynald Affeldt, Cyril Cohen, et al. · Lecture notes in computer science · 18
A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic
2012 · François Bobot, Sylvain Conchon, et al. · Lecture notes in computer science · 16
Trocq: Proof Transfer for Free, With or Without Univalence
2024 · Cyril Cohen, Enzo Crance, et al. · Lecture notes in computer science · 15
PDF
A Computer-Algebra-Based Formal Proof of the Irrationality of ζ(3)
2014 · Frédéric Chyzak, Assia Mahboubi, et al. · Lecture notes in computer science · 14
A formal study of Bernstein coefficients and polynomials
2011 · YVES BERTOT, FRÉDÉRIQUE GUILHOT, et al. · Mathematical Structures in Computer Science · 14
Formalized algebraic numbers (construction and first-order theory)
2012 · COHEN, Cyril, MAHBOUBI, Assia · OpenGrey (Institut de l'Information Scientifique et Technique) · 13
Formally Verified Approximations of Definite Integrals
2016 · Assia Mahboubi, Guillaume Melquiond, et al. · Lecture notes in computer science · 11
Proving Formally the Implementation of an Efficient gcd Algorithm for Polynomials
2006 · Assia Mahboubi · Lecture notes in computer science · 11
Formally Verified Approximations of Definite Integrals
2018 · Assia Mahboubi, Guillaume Melquiond, et al. · Journal of Automated Reasoning · 8
A bisimulation between DPLL(T) and a proof-search strategy for the focused sequent calculus
2013 · Mahfuza Farooque, Stéphane Graham-Lengrand, et al. · 6
A Formal Quantifier Elimination for Algebraically Closed Fields
2010 · Cyril Cohen, Assia Mahboubi · Lecture notes in computer science · 6
Compositional Pre-processing for Automated Reasoning in Dependent Type Theory
2023 · Valentin Blot, Denis Cousineau, et al. · ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP) · 5
PDF
A.: Formal proofs in real algebraic geometry: from ordered fields to quantifier elimination
2011 · Cyril Cohen, Assia Mahboubi, et al. · 5
New Results - A book on mathematical components
2016 · E. ̃Tassi, Yves Bertot, et al. · 4
Contributions à la certification des calculs dans R : théorie, preuves, programmation
2006 · Assia Mahboubi · HAL (Le Centre pour la Communication Scientifique Directe) · 4
Programming and certifying the CAD algorithm inside the Coq system
2006 · Assia Mahboubi, Inria Sophia Antipolis, et al. · 4
Works count: 114
Citation count: 1,183
H-index: 14
I10-index: 18
Year
Topic
Type