Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Zakaria Chihani"'
Autor:
Alexandre Dey, Benjamin Costé, Éric Totel, Adrien Bécue, Elkin Aguas, Anthony Lambert, Gregory Blanc, Hervé Debar, Yannick Chevalier, Amine Medad, Baptiste Gregorutti, Edouard Genetay, Alexandre Peter Nguema, Grégoire Menguy, Sébastien Bardin, Richard Bonichon, Cauim de de Souza Lima, Rémy Charayron, Thierry Lefèvre, Nathalie Bartoli, Joseph Morlier, Zakaria Chihani, Bruno Carron, Stephan Brunessaux, Léonard Caquot, Tristan Charrier, Badre El Bezzaz Semlali, Oudomsack Pierre Pasquero, Alexis Bazin, Pierre-Elisée Flory, Katarzyna Kapusta, Oana Stan, Vincent Thouvenot, Karel Hynek, Romain Ferrari, Aimen Boudguiga, Renaud Sirdey, Alice Héliou, Thomas Cejka, Daria La Rocca, Martin Zuber, George Vardoulias, Ioannis Papaioannou, Andreas Vekinis, Georgia Papadopoulou, Marc Vincent, Amal El Fallah-Seghrouchni, Vincent Corruble, Narayan Bernardin, Rami Kassab, Frédéric Barbaresco, Karim Tit, Teddy Furon, Mathias Rousset, Louis-Marie Traonouez, Pierre-Yves Lagrave, Vincent Vidal, Marie-Caroline Corbineau, Tugdual Ceillier, Aleksei Iancheruk, Ahmed Allali, Julien Rodriguez, Tejas Bhor, Ricardo Garcia, Jean-Eudes Guilhot-Gaudeffroy, Robert Plana
Publikováno v:
pp.1-152, 2021
HAL
HAL
6th European Cyber Week (6ème semaine européenne de la cybersécurité et de la cyberdéfense)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::f7dfc118ffb956c27559ee25e9520267
https://hal.science/hal-03535661
https://hal.science/hal-03535661
Autor:
Julien Henri-Aurélien Girard-Satabin, Aymeric Varasse, Guillaume Charpiat, Zakaria Chihani, Marc Schoenauer
Publikováno v:
Journées Francophones des Langages Applicatifs
Journées Francophones des Langages Applicatifs, Apr 2021, Saint Médard d’Excideuil, France
HAL
Journées Francophones des Langages Applicatifs, Apr 2021, Saint Médard d’Excideuil, France
HAL
National audience; La grande polyvalence et les résultats impressionnants des réseaux de neurones modernes viennent en partie de leur non-linéarité. Cette propriété fondamentale rend malheureusement très difficile leur vérification formelle,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::c54fcb7a688f109a211e1469dee67989
https://inria.hal.science/hal-03127853/document
https://inria.hal.science/hal-03127853/document
Publikováno v:
EPiC Series in Computing.
We present the design philosophy of a proof checker based on a notion of foundational proof certificates. At the heart of this design is a semantics of proof evidence that arises from recent advances in the theory of proofs for classical and intuitio
Publikováno v:
CPAIOR 2017. International Conference on AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
CPAIOR 2017. International Conference on AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Jun 2017, Padova, Italy
Integration of AI and OR Techniques in Constraint Programming ISBN: 9783319597751
CPAIOR
CPAIOR 2017. International Conference on AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Jun 2017, Padova, Italy
Integration of AI and OR Techniques in Constraint Programming ISBN: 9783319597751
CPAIOR
International audience; We address the challenge of developing efficient Constraint Programming-based approaches for solving formulas over the quantifier-free fragment of the theory of bitvectors (BV), which is of paramount importance in software ver
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2ab63d18cde8cd6227442464a51bd9e3
https://cea.hal.science/cea-01795779/file/bv-cpaior.pdf
https://cea.hal.science/cea-01795779/file/bv-cpaior.pdf
Publikováno v:
Automated Deduction – CADE 26 ISBN: 9783319630458
CADE
CADE 26-26th International Conference on Automated Deduction
CADE 26-26th International Conference on Automated Deduction, Aug 2017, Gothenburg, Sweden
CADE
CADE 26-26th International Conference on Automated Deduction
CADE 26-26th International Conference on Automated Deduction, Aug 2017, Gothenburg, Sweden
International audience; The Foundational Proof Certificate (FPC) framework can be used to define the semantics of a wide range of proof evidence. For example , such definitions exist for a number of textbook proof systems as well as for the proof evi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a7e8b5e2fd5f7f0d0ee7bc1743e9c66d
https://doi.org/10.1007/978-3-319-63046-5_16
https://doi.org/10.1007/978-3-319-63046-5_16
Publikováno v:
Journal of Automated Reasoning
Journal of Automated Reasoning, Springer Verlag, 2017, 59 (3), pp.287-330. ⟨10.1007/s10817-016-9380-6⟩
Journal of Automated Reasoning, 2017, 59 (3), pp.287-330. ⟨10.1007/s10817-016-9380-6⟩
Journal of Automated Reasoning, Springer Verlag, 2017, 59 (3), pp.287-330. ⟨10.1007/s10817-016-9380-6⟩
Journal of Automated Reasoning, 2017, 59 (3), pp.287-330. ⟨10.1007/s10817-016-9380-6⟩
International audience; Theorem provers produce evidence of proof in many different formats, such as proof scripts, natural deductions, resolution refutations, Herbrand expansions, and equational rewritings. In implemented provers, numerous variants
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9042bde3070c63940732ea5153a29a9e
https://hal.inria.fr/hal-01390912/document
https://hal.inria.fr/hal-01390912/document
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783319243115
TABLEAUX
Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX)
Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX), Sep 2015, Wroclaw, Poland. pp.201-210, ⟨10.1007/978-3-319-24312-2_14⟩
TABLEAUX
Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX)
Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX), Sep 2015, Wroclaw, Poland. pp.201-210, ⟨10.1007/978-3-319-24312-2_14⟩
International audience; Different theorem provers work within different formalisms and paradigms, and therefore produce various incompatible proof objects. Currently there is a big effort to establish foundational proof certificates (FPC), which woul
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f87028a92c665038e1978b64d8e3f442
https://doi.org/10.1007/978-3-319-24312-2_14
https://doi.org/10.1007/978-3-319-24312-2_14
Publikováno v:
PxTP 2013. Third International Workshop on Proof Exchange for Theorem Proving.
Publikováno v:
Automated Deduction – CADE-24 ISBN: 9783642385735
CADE
CADE-24th International Conference on Automated Deduction
CADE-24th International Conference on Automated Deduction, Jun 2013, Lake Placid, United States
Lecture Notes in Computer Science
CADE
CADE-24th International Conference on Automated Deduction
CADE-24th International Conference on Automated Deduction, Jun 2013, Lake Placid, United States
Lecture Notes in Computer Science
International audience; It is the exception that provers share and trust each others proofs. One reason for this is that different provers structure their proof evidence in remarkably different ways, including, for example, proof scripts, resolution
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::36a3ae823e61de0c634f82ef5242b5be
https://doi.org/10.1007/978-3-642-38574-2_11
https://doi.org/10.1007/978-3-642-38574-2_11
Autor:
Zakaria Chihani, Dale Miller
Publikováno v:
Electronic Notes in Theoretical Computer Science
Electronic Notes in Theoretical Computer Science, Elsevier, 2016, 323, pp.93-108. ⟨10.1016/j.entcs.2016.06.007⟩
Electronic Notes in Theoretical Computer Science, 2016, 323, pp.93-108. ⟨10.1016/j.entcs.2016.06.007⟩
LSFA
Electronic Notes in Theoretical Computer Science, Elsevier, 2016, 323, pp.93-108. ⟨10.1016/j.entcs.2016.06.007⟩
Electronic Notes in Theoretical Computer Science, 2016, 323, pp.93-108. ⟨10.1016/j.entcs.2016.06.007⟩
LSFA
International audience; The kinds of inference rules and decision procedures that one writes for proofs involving equality and rewriting are rather different from proofs that one might write in first-order logic using, say, sequent calculus or natura