Zobrazeno 1 - 10
of 94
pro vyhledávání: '"Martínez, Guido"'
Autor:
Andrici, Cezar-Constantin, Ciobaca, Stefan, Hritcu, Catalin, Martínez, Guido, Rivas, Exequiel, Tanter, Éric, Winterhalter, Théo
We introduce SCIO*, a formally secure compilation framework for statically verified partial programs performing input-output (IO). The source language is an F* subset in which a verified program interacts with its IO-performing context via a higher-o
Externí odkaz:
http://arxiv.org/abs/2303.01350
Autor:
Swamy, Nikhil, Rastogi, Aseem, Fromherz, Aymeric, Merigoux, Denis, Ahman, Danel, Martínez, Guido
Much recent research has been devoted to modeling effects within type theory. Building on this work, we observe that effectful type theories can provide a foundation on which to build semantics for more complex programming constructs and program logi
Externí odkaz:
http://arxiv.org/abs/2111.15149
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Maillard, Kenji, Ahman, Danel, Atkey, Robert, Martinez, Guido, Hritcu, Catalin, Rivas, Exequiel, Tanter, Éric
This paper proposes a general semantic framework for verifying programs with arbitrary monadic side-effects using Dijkstra monads, which we define as monad-like structures indexed by a specification monad. We prove that any monad morphism between a c
Externí odkaz:
http://arxiv.org/abs/1903.01237
Autor:
Martínez, Guido, Ahman, Danel, Dumitrescu, Victor, Giannarakis, Nick, Hawblitzel, Chris, Hritcu, Catalin, Narasimhamurthy, Monal, Paraskevopoulou, Zoe, Pit-Claudel, Clément, Protzenko, Jonathan, Ramananandro, Tahina, Rastogi, Aseem, Swamy, Nikhil
We introduce Meta-F*, a tactics and metaprogramming framework for the F* program verifier. The main novelty of Meta-F* is allowing the use of tactics and metaprogramming to discharge assertions not solvable by SMT, or to just simplify them into well-
Externí odkaz:
http://arxiv.org/abs/1803.06547
Autor:
Díaz-Caro, Alejandro, Martínez, Guido
Publikováno v:
ENTCS 338:115-131, 2018
Driven by the interest of reasoning about probabilistic programming languages, we set out to study a notion of unicity of normal forms for them. To provide a tractable proof method for it, we define a property of distribution confluence which is show
Externí odkaz:
http://arxiv.org/abs/1708.03536
Autor:
Ahman, Danel, Hritcu, Catalin, Maillard, Kenji, Martinez, Guido, Plotkin, Gordon, Protzenko, Jonathan, Rastogi, Aseem, Swamy, Nikhil
Dijkstra monads enable a dependent type theory to be enhanced with support for specifying and verifying effectful code via weakest preconditions. Together with their closely related counterparts, Hoare monads, they provide the basis on which verifica
Externí odkaz:
http://arxiv.org/abs/1608.06499
Publikováno v:
In Food and Bioproducts Processing September 2019 117:14-29
Autor:
Martínez-Guido, Sergio Iván, Ríos-Badrán, Inés María, Gutiérrez-Antonio, Claudia, Ponce-Ortega, José María
Publikováno v:
In Renewable Energy January 2019 130:622-632
Autor:
Caltzontzin-Rabell, Valeria, Lara-Montaño, Oscar Daniel, Romero-Izquierdo, Araceli Guadalupe, Martínez-Guido, Sergio Iván, Hernández, Salvador, Gutiérrez-Antonio, Claudia
Publikováno v:
In Agroenergy 2024:213-237