Modern subgraph-finding algorithm implementations consist of thousands of lines of highly
optimized code, and this complexity raises questions about their trustworthiness. Recently …

Theories over strings are among the most heavily researched logical theories in the SMT
community in the past decade, owing to the error-prone nature of string manipulations …

Verifying safety and liveness over array systems is a highly challenging problem. Array
systems naturally capture parameterized systems such as distributed protocols with an …

We present a certified algebraic abstraction technique for verifying bit-accurate non-linear
integer computations. In algebraic abstraction, programs are lifted to polynomial equations …

COQCRYPTOLINE is an automatic certified verification tool for cryptographic programs. It is
built on OCAML programs extracted from algorithms fully certified in COQ with SS …

Approximate model counting is the task of approximating the number of solutions to an input
Boolean formula. The state-of-the-art approximate model counter for formulas in conjunctive …

We prove the correctness of invertibility conditions for the theory of fixed-width bit-vectors—
used to solve quantified bit-vector formulas in the Satisfiability Modulo Theories (SMT) solver …

Low-level systems code often needs to interact with data, such as page table entries or
network packet headers, in which multiple pieces of information are packaged together as …

We present the verified model checker CoqCryptoLine for cryptographic programs with
certified verification results. The CoqCryptoLine verification algorithm consists of two …

As software grows increasingly pervasive in our everyday lives, it is important to ensure that
the software we rely on, especially in safety-critical systems, behaves as expected. Whereas …