While model checking safety of infinite-state systems by inferring state invariants has
steadily improved recently, most verification tools still rely on a technique based on bounded …

Automated reasoners, such as SAT/SMT solvers and first-order provers, are becoming the
backbones of rigorous systems engineering, being used for example in applications of …

Automated reasoners, such as SAT/SMT solvers and first-order provers, are becoming the
backbones of applications of formal methods, for example in automating deductive …

To put sound program analysis at the fingertips of the software developer, we propose a
framework for interactive abstract interpretation of multithreaded C code. Abstract …

This article provides an innovative approach for verification by model checking of programs
that undergo continuous changes. To tackle the problem of repeating the entire model …

Linear arithmetic over reals (LRA) underlies a wide range of SMT-based modeling
approaches, and, strengthened with Craig interpolation using Farkas' lemma, is a central …

Blockchain technologies have drawn significant attention from both academia and industry
over the last decade, with increasing adoption by the general public and potential to …

The safety of critical systems and data is of paramount importance to society. Attacks on
these systems can have catastrophic consequences, and the security of these systems is …

Automated reasoners, such as SAT and SMT solvers as well as first-order theorem provers,
are becoming the backbones of applications of formal methods, for example in automating …

Formal verification by model checking is an award-winning (Turing award, 2007) technology
to verify systems exhaustively and automatically in order to increase the degree of …