Zobrazeno 1 - 10
of 20
pro vyhledávání: '"Mebsout, Alain"'
Publikováno v:
EPTCS 239, 2017, pp. 1-13
Due to undecidability and complexity of first-order logic, SMT solvers may not terminate on some problems or require a very long time. When this happens, one would like to find the reasons why the solver fails. To this end, we have designed AltGr-Erg
Externí odkaz:
http://arxiv.org/abs/1701.07124
Autor:
Mebsout, Alain
Cette thèse aborde le problème de la vérification automatique de systèmesparamétrés complexes. Cette approche est importante car elle permet de garantircertaines propriétés sans connaître a priori le nombre de composants dusystème. On s'int
Externí odkaz:
http://www.theses.fr/2014PA112188/document
Autor:
Ekici, Burak, Katz, Guy, Keller, Chantal, Mebsout, Alain, Reynolds, Andrew J., Tinelli, Cesare
Publikováno v:
EPTCS 210, 2016, pp. 21-29
This extended abstract reports on current progress of SMTCoq, a communication tool between the Coq proof assistant and external SAT and SMT solvers. Based on a checker for generic first-order certificates implemented and proved correct in Coq, SMTCoq
Externí odkaz:
http://arxiv.org/abs/1606.05947
Autor:
Bozman, Çagdas, Iguernlala, Mohamed, Laporte, Michael, Levillain, Maxime, Mebsout, Alain, Conchon, Sylvain
Publikováno v:
Journées Francophones des Langages Applicatifs
33èmes Journées Francophones des Langages Applicatifs
33èmes Journées Francophones des Langages Applicatifs, Jun 2022, Saint-Médard-d'Excideuil, France. pp.248-250
33èmes Journées Francophones des Langages Applicatifs
33èmes Journées Francophones des Langages Applicatifs, Jun 2022, Saint-Médard-d'Excideuil, France. pp.248-250
National audience; Cet article présente Mitten, un outil pour décrire finement et jouer des scénarios sur une implémentation de Tenderbake-le prochain protocole de consensus à la pBFT de la blockchain Tezos. Mitten est paramétrable pour filtrer
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______165::625424c0885cc0523eeee913e79500a6
https://inria.hal.science/hal-03626847
https://inria.hal.science/hal-03626847
Publikováno v:
Open Access Series in Informatics
Open Access Series in Informatics, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, In press, ⟨10.4230/OASIcs.FMBC.2021.5⟩
Open Access Series in Informatics, In press, ⟨10.4230/OASIcs.FMBC.2021.5⟩
Open Access Series in Informatics, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, In press, ⟨10.4230/OASIcs.FMBC.2021.5⟩
Open Access Series in Informatics, In press, ⟨10.4230/OASIcs.FMBC.2021.5⟩
International audience; In this paper, we propose a formal documentation of Tenderbake, the new Tezos consensus algorithm, slated to replace the current Emmy family algorithms. The algorithm is broken down to its essentials and represented as an auto
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::f04c26f07a20fd99c411fc662b008d2a
https://hal.archives-ouvertes.fr/hal-03398884/file/main.pdf
https://hal.archives-ouvertes.fr/hal-03398884/file/main.pdf
In this paper, we propose a formal documentation of Tenderbake, the new Tezos consensus algorithm, slated to replace the current Emmy family algorithms. The algorithm is broken down to its essentials and represented as an automaton. The automaton mod
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dcfad1f11e452a48cd0e8f803eb97d2a
Publikováno v:
SMT Workshop: International Workshop on Satisfiability Modulo Theories
SMT Workshop: International Workshop on Satisfiability Modulo Theories, Jul 2018, Oxford, United Kingdom
SMT Workshop: International Workshop on Satisfiability Modulo Theories, Jul 2018, Oxford, United Kingdom
International audience; Alt-Ergo is an SMT solver jointly developed by Université Paris-Sud and the OCamlPro company. The first version was released in 2006. Since then, its architecture has been continuously adapted for proving formulas generated b
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______2592::abc4f5d5d03758132720b0f1134df945
https://hal.inria.fr/hal-01960203/document
https://hal.inria.fr/hal-01960203/document
Autor:
Canou, Benjamin, Henry, Grégoire, Chambart, Pierre, Le Fessant, Fabrice, Bozman, Cagdas, Bernardoff, Vincent, Rieu, Guillem, Iguernelala, Mohamed, Mebsout, Alain, Breitman, Arthur
Publikováno v:
OCaml 2017-OCaml Users and Developers Workshop
OCaml 2017-OCaml Users and Developers Workshop, Sep 2017, Oxford, United Kingdom. pp.1-2
OCaml 2017-OCaml Users and Developers Workshop, Sep 2017, Oxford, United Kingdom. pp.1-2
International audience; In this talk, we will present the story of the Tezos project. Tezos is a crypto-ledger, i.e. a distributed blockchain with a language to express smart contracts, with two specific characteristics: the first one is its ability
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::572549f04a34d4bce45429c3c7c14e9c
https://hal.inria.fr/hal-01661696
https://hal.inria.fr/hal-01661696
Autor:
Mebsout, Alain
Publikováno v:
Autre [cs.OH]. Université Paris Sud-Paris XI, 2014. Français. ⟨NNT : 2014PA112188⟩
This thesis tackles the problem of automatically verifying complexparameterized systems. This approach is important because it can guarantee thatsome properties hold without knowing a priori the number of components in thesystem. We focus in particul
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::d4898bf745a6f610eeec04bf43360b79
https://tel.archives-ouvertes.fr/tel-01073980/file/VA2_MEBSOUT_ALAIN_29092014.pdf
https://tel.archives-ouvertes.fr/tel-01073980/file/VA2_MEBSOUT_ALAIN_29092014.pdf
Publikováno v:
JFLA
JFLA, Jan 2014, Fréjus, France
JFLA, Jan 2014, Fréjus, France
National audience; Toutes les bibliothèques de threads au standard POSIX se doivent d'\implementer une barrière de synchronisation. Une telle structure de contrôle permet à des threads de s'attendre en un point donné d'un programme. Il existe de
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::6251a47c80c8ab87bfbb3b1e9b9467ec
https://inria.hal.science/hal-01088655/document
https://inria.hal.science/hal-01088655/document