The concept of blockchain was developed with the purpose of decentralizing the trade of
assets, suppressing the need for intermediaries during this process, as well as achieving a …

On Fixpoint/Iteration/Variant Induction Principles for Proving Total Correctness of Programs with
Denotational Semantics | SpringerLink Skip to main content Advertisement SpringerLink Account …

We consider Hoare-style verification for the graph programming language GP 2. In previous
work, graph properties were specified by so-called E-conditions which extend nested graph …

We present a novel denotational semantics for the untyped call-by-value λ-calculus, where
terms are interpreted as stable relations, ie as binary relations between substitutions and …

We propose a semantics of operating on real numbers that is sound, Turingcomplete, and
practical. It modifies the intuitive but super-recursive Blum-Shub-Smale model (formalizing …

Cette thèse s' intéresse à la programmation certifiée correcte dans le cadre formel fourni par
l'assistant de preuve Coq, et conduite par étapes de raffinements, avec l'objectif d'aboutir à …

Invariants and induction lemmata are of essential importance for many verification
procedures. However, even though a given property might be true, it may not be possible to …

We study a syntax for specifying quantitative" assertions"-functions mapping program states
to numbers-for probabilistic program verification. We prove that our syntax is expressive in …

We consider Hoare-style verification for the graph programming language GP 2. In previous
work, graph properties were specified by so-called E-conditions which extend nested graph …

This thesis studies notions of program equivalence for a call-by-push-value functional
language with algebraic effects and general recursion. We mainly focus on behavioural …