With distributed computing becoming ubiquitous in the modern era, safe distributed
programming is an open challenge. To address this, multiparty session types (MPST) …

There are two approaches to automatically deriving symbolic worst-case resource bounds
for programs: static analysis of the source code and data-driven analysis of cost …

Refinement types combine SMT decidable constraints with a compositional, syntax-directed
type system to provide a convenient way to statically and automatically check properties of …

Practical checkers based on refinement types use the combination of implicit semantic
subtyping and parametric polymorphism to simplify the specification and automate the …

Practical checkers based on refinement types use the combination of implicit semantic sub-
typing and parametric polymorphism to simplify the specification and automate the …

Programs inevitably contain bugs. Fortunately, recent research and engineering efforts
across the industry and academia made significant advances in static analysis techniques …

In this invited talk, we discuss state of the art in neural network verification. We propose the
term continuous verification to characterise the family of methods that explore continuous …

As networked systems become critical infrastructure, their design must reflect their new
societal role. Today, we build systems with hundreds of heuristics but often do not …

Abstract Search-Based Software Engineering problems frequently have semantic
constraints that can be used to deterministically restrict what type of programs can be …

A distributed system consists of various components working in coordination, usually
following a specified protocol. Multiparty session types (MPST) are a typing discipline for …