Modern software systems are increasingly requested to be adaptive to changes in the
environment in which they are embedded. Moreover, adaptation often needs to be …

Dynamic specification mining observes program executions to infer models of normal
program behavior. What makes us believe that we have seen sufficiently many executions …

Formal methods applications often rely on SMT solvers to automatically discharge proof
obligations. SMT solvers handle quantified formulas using incomplete heuristic techniques …

Abstract The Object Constraint Language (OCL) can be used to capture structural
constraints in the context of the abstract syntax of modelling languages (metamodels) …

Automated deduction uses computation to perform symbolic logical reasoning. It has been a
core technology for program verification from the very beginning. Satisfiability solvers for …

We introduce Meta-F*, a tactics and metaprogramming framework for the F* program verifier.
The main novelty of Meta-F* is allowing the use of tactics and metaprogramming to …

Dynamic specification mining observes program executions to infer models of normal
program behavior. What makes us believe that we have seen sufficiently many executions …

We present a novel Hoare-style logic, called Reverse Hoare Logic, which can be used to
reason about state reachability of imperative programs. This enables us to give natural …

Deep Learning (DL) techniques are increasingly being incorporated in critical software
systems today. DL software is buggy too. Recent work in SE has characterized these bugs …

Abstract The Move Prover (MVP) is a formal verifier for smart contracts written in the Move
programming language. MVP has an expressive specification language, and is fast and …