Abstract Development of formal proofs of correctness of programs can increase actual and
perceived reliability and facilitate better understanding of program specifications and their …

Verified Textbook Algorithms | SpringerLink Skip to main content Advertisement SpringerLink
Account Menu Find a journal Publish with us Track your research Search Cart Book cover …

Many algorithms can be implemented most efficiently with imperative data structures. This
paper presents Sepref, a stepwise refinement based tool chain for the verification of …

Interactive theorem provers have developed dramatically over the past four decades, from
primitive beginnings to today's powerful systems. Here, we focus on Isabelle/HOL and its …

SAT solvers decide the satisfiability of Boolean formulas in conjunctive normal form. They
are commonly used for software and hardware verification. Modern SAT solvers are highly …

We present the Autoref tool for Isabelle/HOL, which automatically refines algorithms
specified over abstract concepts like maps and sets to algorithms over concrete …

We present a framework to generate verified LLVM programs from Isabelle/HOL. It is based
on a code generator that generates LLVM text from a simplified fragment of LLVM, shallowly …

Runtime verification tools must correctly establish a specification's validity or detect
violations. This task is difficult, especially when the specification is given in an expressive …

We present a new algorithm to construct a (generalized) deterministic Rabin automaton for
an LTL formula φ. The automaton is the product of a master automaton and an array of slave …

We present an efficient formally verified checker for satisfiability and unsatisfiability
certificates for Boolean formulas in conjunctive normal form. It utilizes a two phase approach …