Zobrazeno 1 - 10
of 671
pro vyhledávání: '"Pereira, Mario"'
We present our work on the collaborative use of dynamic and static analysis tools for the verification of software written in the OCaml language. We build upon Gospel, a specification language for OCaml that can be used both in dynamic and static ana
Externí odkaz:
http://arxiv.org/abs/2407.17289
Autor:
Pereira, Mário
In this paper, we provide a comprehensive, hands-on tutorial on how to apply deductive verification to programs written in OCaml. In particular, we show how one can use the GOSPEL specification language and the Cameleer tool to conduct mostly-automat
Externí odkaz:
http://arxiv.org/abs/2404.17901
Simulating long-term hydrothermal bid-based markets considering strategic agents is a challenging task. The representation of strategic agents considering inter-temporal constraints within a stochastic framework brings additional complexity to the al
Externí odkaz:
http://arxiv.org/abs/2403.07270
Stochastic Dual Dynamic Programming (SDDP) is a widely used and fundamental algorithm for solving multistage stochastic optimization problems. Although SDDP has been frequently applied to solve risk-averse models with the Conditional Value-at-Risk (C
Externí odkaz:
http://arxiv.org/abs/2307.13190
Autor:
Figueira-Pereira, Mario, Barber, Xavier, Conesa, David, López-Quílez, Antonio, Martínez-Minaya, Joaquín, Paradinas, Iosu, Pennino, Maria Grazia
In ecology we may find scenarios where the same phenomenon (species occurrence, species abundance, etc.) is observed using two different types of samplers. For instance, species data can be collected from scientific sampling with a completely random
Externí odkaz:
http://arxiv.org/abs/2305.17922
Autor:
Soares, Tiago, Pereira, Mário
Algebraic effects and handlers are a powerful abstraction to build non-local control-flow mechanisms such as resumable exceptions, lightweight threads, co-routines, generators, and asynchronous I/O. All of such features have very evolved semantics, h
Externí odkaz:
http://arxiv.org/abs/2302.01265
Xavier Leroy and Sandrine Blazy in 2007 conducted a formal verification, using the Coq proof assistant, of a memory model for low-level imperative languages such as C. Considering their formalization was performed essentially in first-order logic, on
Externí odkaz:
http://arxiv.org/abs/2212.02425
Autor:
Castanho, Daniel, Pereira, Mário
Functional programming offers the perfect ground for building correct-by-construction software. Languages of such paradigm normally feature state-of-the-art type systems, good abstraction mechanisms, and well-defined execution models. We claim that a
Externí odkaz:
http://arxiv.org/abs/2207.09854
Autor:
Jayakrishnan, Ampattu R., Isfahani, Vahideh B., Nair, Surya Kiran P., Sekhar, Koppole C., Marques, Luís S., Pereira, Mario, MacManus-Driscoll, Judith L., Silva, José P.B.
Publikováno v:
In Journal of Energy Storage 1 September 2024 97 Part A
Autor:
Pant, Jharendu, Bhujel, Ram C., du Carmu, Adriano Dani F., de Jesus, Lucas Soares, Gomes, Silvino, Pereira, Mario, Teoh, Shwu Jiau
Publikováno v:
In Agricultural Systems August 2024 219