Proving functional correctness of monadic programs using separation logic

Interaction trees are an active development in representing effectful and impure pro- grams in the Coq proof assistant. Examples of programs they can represent are programs that use: mutable state, concurrency and general recursion. Besides representing these programs we also want to reason about and verify these programs using separation logic....

Actris 2.0: Asynchronous session-type based reasoning in separation logic

Message passing is a useful abstraction for implementing concurrent programs. For real-world systems, however, it is often combined with other programming and concurrency paradigms, such as higher-order functions, mutable state, shared-memory concurrency, and locks. We present Actris: a logic for proving functional correctness of programs...

Compositional non-interference for fine-grained concurrent programs

Non-interference is a program property that ensures the absence of information leaks. In the context of programming languages, there exist two common approaches for establishing non-interference: type systems and program logics. Type systems provide strong automation (by means of type checking), but they are inherently restrictive in the kind...

Machine-checked semantic session typing

Session types- A family of type systems for message-passing concurrency-have been subject to many extensions, where each extension comes with a separate proof of type safety. These extensions cannot be readily combined, and their proofs of type safety are generally not machine checked, making their correctness less trustworthy. We overcome...

Actris: Session-type based reasoning in separation logic

Message passing is a useful abstraction to implement concurrent programs. For real-world systems, however, it is often combined with other programming and concurrency paradigms, such as higher-order functions, mutable state, shared-memory concurrency, and locks. We present Actris: a logic for proving functional correctness of programs that...

Scala step-by-step: Soundness for DOT with step-indexed logical relations in Iris

The metatheory of Scala's core type system - the Dependent Object Types (DOT) calculus - is hard to extend, like the metatheory of other type systems combining subtyping and dependent types. Soundness of important Scala features therefore remains an open problem in theory and in practice. To address some of these problems, we use a semantics...

Ionospheric monitoring using GNSS data from LEO satellites for space weather applications: (additional thesis)

In this report, a least-squares approach is described for retrieving the 3D structure of the electron concentration in the Earth’s upper ionosphere and plasmasphere, using Global Navigation Satellite System (GNSS) data-sets from Low-Earth-Orbiting (LEO) satellites. Due to the lack of horizontal radio wave geometries, the method uses assumptions...

Functional thresholds for designmaintenance of urban pavements: Functional criteria for sustainable design of urban pavements

Functional criteria have been mostly defined in urban pavements using subjective methods, rather than by means of objective and repeatable procedures. The Whole<br/>Body Vibration, the Heart Rate Variability, and new technologies to determine the<br/>IRI (International Roughness Index), are nowadays available. For that, an analysis of<br/...

Irisidentificatiesystemen

Irisidentificatiesystemen zijn veelbelovende en betrouwbare biometrische systemen die al op sommige plaatsen in gebruik zijn genomen. Een methode voor het identificeren van personen aan de hand van hun irispatronen is gepatenteerd door John Daugman van Cambridge University. In dit project worden de iris, het irisidentificatiesysteem van John...