6 citations · 17 across the 9 of their papers we have counts for
6 papers · 1 filter
A Framework for the Automated Verification of Algebraic Effects and Handlers (extended version)
Tiago Soares, Mário Pereira
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…
Leroy and Blazy were right: their memory model soundness proof is automatable (Extended Version)
Pedro Barroso, Mário Pereira, António Ravara
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…
Auto-active Verification of Graph Algorithms, Written in OCaml
Daniel Castanho, Mário Pereira
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 abst…
Cameleer: a Deductive Verification Tool for OCaml (extended version)
Mário Pereira, António Ravara
OCaml is particularly well-fitted for formal verification. On one hand, it is a multi-paradigm language with a well-defined semantics, allowing one to write clean, concise, type-sa…
Animated Logic: Correct Functional Conversion to Conjunctive Normal Form
Pedro Barroso, Mário Pereira, António Ravara
We present an approach to obtain formally verified implementations of classical Computational Logic algorithms. We choose the Why3 platform because it allows to implement functions…
Desfuncionalizar para Provar
Mário Pereira
This paper explores the idea of using defunctionalization as a proof technique for higher-order programs. Defunctionalization builds on substituting functional values by a first-or…