default search action
Assia Mahboubi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c26]Assia Mahboubi, Matthieu Piquerez:
A First Order Theory of Diagram Chasing. CSL 2024: 38:1-38:19 - [c25]Cyril Cohen
, Enzo Crance
Trocq: Proof Transfer for Free, With or Without Univalence. ESOP (1) 2024: 239-268 - [c24]Cyril Cohen
Artifact Report: Trocq: Proof Transfer for Free, With or Without Univalence. ESOP (1) 2024: 269-274 - [c23]Benoît Guillemet, Assia Mahboubi, Matthieu Piquerez:
Machine-Checked Categorical Diagrammatic Reasoning. FSCD 2024: 7:1-7:19 - [i9]Benoît Guillemet, Assia Mahboubi, Matthieu Piquerez:
Machine-Checked Categorical Diagrammatic Reasoning. CoRR abs/2402.14485 (2024) - 2023
- [c22]Assia Mahboubi:
Machine-Checked Computational Mathematics (Invited Talk). CALCO 2023: 5:1-5:1 - [c21]Valentin Blot, Denis Cousineau, Enzo Crance, Louise Dubois de Prisque, Chantal Keller, Assia Mahboubi, Pierre Vial:
Compositional Pre-processing for Automated Reasoning in Dependent Type Theory. CPP 2023: 63-77 - [i8]Cyril Cohen, Enzo Crance, Assia Mahboubi:
Trocq: Proof Transfer for Free, With or Without Univalence. CoRR abs/2310.14022 (2023) - [i7]Assia Mahboubi, Matthieu Piquerez:
A First Order Theory of Diagram Chasing. CoRR abs/2311.01790 (2023) - 2022
- [c20]Martin Baillon, Assia Mahboubi, Pierre-Marie Pédrot:
Gardening with the Pythia A Model of Continuity in a Dependent Setting. CSL 2022: 5:1-5:18 - [i6]Valentin Blot, Denis Cousineau, Enzo Crance, Louise Dubois de Prisque, Chantal Keller, Assia Mahboubi, Pierre Vial:
Modular pre-processing for automated reasoning in dependent type theory. CoRR abs/2204.02643 (2022) - 2021
- [b2]Assia Mahboubi:
Machine-checked computer-aided mathematics. University of Nantes, France, 2021 - [j8]Assia Mahboubi, Thomas Sibut-Pinote:
A Formal Proof of the Irrationality of ζ(3). Log. Methods Comput. Sci. 17(1) (2021) - [c19]Assia Mahboubi:
Mathematical Structures in Dependent Type Theory (Invited Talk). CSL 2021: 2:1-2:3 - [c18]Sophie Bernard, Cyril Cohen
Unsolvability of the Quintic Formalized in Dependent Type Theory. ITP 2021: 8:1-8:18 - 2020
- [j7]Jeremy Avigad
Preface: Selected Extended Papers from Interactive Theorem Proving 2018. J. Autom. Reason. 64(5): 793-794 (2020) - [c17]Reynald Affeldt, Cyril Cohen
Competing Inheritance Paths in Dependent Type Theory: A Case Study in Functional Analysis. IJCAR (2) 2020: 3-20 - [e3]Marc Bezem, Assia Mahboubi:
25th International Conference on Types for Proofs and Programs, TYPES 2019, June 11-14, 2019, Oslo, Norway. LIPIcs 175, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-158-0 [contents]
2010 – 2019
- 2019
- [j6]Assia Mahboubi, Guillaume Melquiond
Formally Verified Approximations of Definite Integrals. J. Autom. Reason. 62(2): 281-300 (2019) - [c16]Florent Bréhard, Assia Mahboubi, Damien Pous:
A Certificate-Based Approach to Formally Verified Approximations. ITP 2019: 8:1-8:19 - [e2]Assia Mahboubi, Magnus O. Myreen:
Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs, CPP 2019, Cascais, Portugal, January 14-15, 2019. ACM 2019, ISBN 978-1-4503-6222-1 [contents] - [i5]Assia Mahboubi, Thomas Sibut-Pinote:
A Formal Proof of the Irrationality of ζ(3). CoRR abs/1912.06611 (2019) - 2018
- [c15]Jeremy Avigad, Assia Mahboubi:
Erratum to: Interactive Theorem Proving. ITP 2018 - [e1]Jeremy Avigad, Assia Mahboubi:
Interactive Theorem Proving - 9th International Conference, ITP 2018, Held as Part of the Federated Logic Conference, FloC 2018, Oxford, UK, July 9-12, 2018, Proceedings. Lecture Notes in Computer Science 10895, Springer 2018, ISBN 978-3-319-94820-1 [contents] - [i4]Andrej Bauer, Martín Hötzel Escardó, Peter LeFanu Lumsdaine, Assia Mahboubi:
Formalization of Mathematics in Type Theory (Dagstuhl Seminar 18341). Dagstuhl Reports 8(8): 130-155 (2018) - 2017
- [j5]Assia Mahboubi:
An induction principle over real numbers. Arch. Math. Log. 56(1-2): 43-49 (2017) - 2016
- [c14]Assia Mahboubi, Guillaume Melquiond
Formally Verified Approximations of Definite Integrals. ITP 2016: 274-289 - 2015
- [c13]Damien Rouhling, Mahfuza Farooque, Stéphane Graham-Lengrand, Assia Mahboubi, Jean-Marc Notin:
Axiomatic Constraint Systems for Proof Search Modulo Theories. FroCos 2015: 220-236 - 2014
- [c12]Assia Mahboubi:
Computer-checked mathematics: a formal proof of the odd order theorem. CSL-LICS 2014: 4:1 - [c11]Frédéric Chyzak, Assia Mahboubi, Thomas Sibut-Pinote, Enrico Tassi:
A Computer-Algebra-Based Formal Proof of the Irrationality of ζ(3). ITP 2014: 160-176 - [i3]Damien Rouhling, Mahfuza Farooque, Stéphane Graham-Lengrand, Assia Mahboubi, Jean-Marc Notin:
Axiomatisation of constraint systems to specify a tableaux calculus modulo theories. CoRR abs/1412.6790 (2014) - 2013
- [c10]Assia Mahboubi, Enrico Tassi:
Canonical Structures for the Working Coq User. ITP 2013: 19-34 - [c9]Georges Gonthier, Andrea Asperti
A Machine-Checked Proof of the Odd Order Theorem. ITP 2013: 163-179 - [c8]Mahfuza Farooque, Stéphane Graham-Lengrand, Assia Mahboubi:
A bisimulation between DPLL(T) and a proof-search strategy for the focused sequent calculus. LFMTP 2013: 3-14 - [c7]Assia Mahboubi:
The Rooster and the Butterflies. MKM/Calculemus/DML 2013: 1-18 - 2012
- [j4]Cyril Cohen, Assia Mahboubi:
Formal proofs in real algebraic geometry: from ordered fields to quantifier elimination. Log. Methods Comput. Sci. 8(1) (2012) - [c6]François Bobot
A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic. IJCAR 2012: 67-81 - [i2]Mahfuza Farooque, Stéphane Lengrand, Assia Mahboubi:
Two simulations about DPLL(T). CoRR abs/1204.5159 (2012) - 2011
- [j3]Yves Bertot, Frédérique Guilhot, Assia Mahboubi:
A formal study of Bernstein coefficients and polynomials. Math. Struct. Comput. Sci. 21(4): 731-761 (2011) - 2010
- [j2]Georges Gonthier, Assia Mahboubi:
An introduction to small scale reflection in Coq. J. Formaliz. Reason. 3(2): 95-152 (2010) - [c5]Cyril Cohen, Assia Mahboubi:
A Formal Quantifier Elimination for Algebraically Closed Fields. AISC/MKM/Calculemus 2010: 189-203
2000 – 2009
- 2009
- [c4]François Garillot
Packaging Mathematical Structures. TPHOLs 2009: 327-342 - 2007
- [j1]Assia Mahboubi:
Implementing the cylindrical algebraic decomposition within the Coq system. Math. Struct. Comput. Sci. 17(1): 99-127 (2007) - [c3]Georges Gonthier, Assia Mahboubi, Laurence Rideau, Enrico Tassi, Laurent Théry:
A Modular Formalisation of Finite Group Theory. TPHOLs 2007: 86-101 - 2006
- [b1]Assia Mahboubi:
Contributions à la certification des calculs dans R : théorie, preuves, programmation. (Contributions to the certification of computations in R : theory, proofs, implementation). University of Nice Sophia Antipolis, France, 2006 - [c2]Assia Mahboubi:
Proving Formally the Implementation of an Efficient gcd Algorithm for Polynomials. IJCAR 2006: 438-452 - 2005
- [c1]Benjamin Grégoire, Assia Mahboubi:
Proving Equalities in a Commutative Ring Done Right in Coq. TPHOLs 2005: 98-113 - [i1]Assia Mahboubi:
Programming and certifying a CAD algorithm in the Coq system. Mathematics, Algorithms, Proofs 2005
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: