Smart contracts are tempting targets of attacks, as they often hold and manipulate significant
financial assets, are immutable after deployment, and have publicly available source code …

Smart contracts challenge the existing, highly efficient techniques applied in symbolic model
checking of software by their unique traits not present in standard programming models. Still …

We present a PDR/IC3 algorithm for finding inductive invariants with quantifier alternations.
We tackle scalability issues that arise due to the large search space of quantified invariants …

Program verification is a resource-hungry task. This paper looks at the problem of
parallelizing SMT-based automated program verification, specifically bounded model …

Industrial hardware verification tasks often require checking a large number of properties
within a testbench. Verification tools often utilize parallelism in their solving orchestration to …

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

We describe a thoroughly interweaved forward and backward version of PDR/IC3 called
fbPDR. Motivated by the complementary strengths of PDR and Reverse PDR and by related …

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

Abstract Property Directed Reachability (PDR) is a relatively new SAT-based search
paradigm for classical AI planning. Compared to earlier SAT-based paradigms, PDR …

The property-directed reachability (PDR) algorithm has been one of the most successful
hardware model checking algorithms powering modern formal property verification tools …