Inspired by recent successes of parallel techniques for solving Boolean satisfiability, we
investigate a set of strategies and heuristics to leverage parallelism and improve the …

The Ethereum platform is a public, distributed, blockchain-based database that is
maintained by independent parties. A user interacts with Ethereum by writing programs and …

Abstract Amazon Web Services (AWS) is a cloud computing services provider that has made
significant investments in applying formal methods to proving correctness of its internal …

Satisfiability modulo finite fields enables automated verification for cryptosystems.
Unfortunately, previous solvers scale poorly for even some simple systems of field …

Property Directed Reachability (PDR) is an efficient model checking technique. However,
the intrinsic high computational complexity prevents PDR from meeting the challenges of …

The inherent complexity of parallel computing makes development, resource monitoring,
and debugging for parallel constraint-solving-based applications difficult. This paper …

Abstract Satisfiability Modulo Theories (SMT) is an extension of the propositional
satisfiability problem (SAT) to other, well-chosen (first-order) theories such as integers, reals …

Recently presented, IC3-inspired symbolic model checking algorithms strengthen the
procedure for showing inductiveness of lemmas expressing reachability of states. These …

Lookahead in propositional satisfiability has proven efficient as a heuristic in pre-and in-
processing, for partitioning instances for parallel solving, and as the main driver of a …

Software configurability opens the door to misconfiguration vulnerabilities, invalid settings
that expose software weaknesses. Misconfiguration is one the top ten most critical security …