The evolution of SAT technology over the last decade has motivated its application in model checking, initially through the utilization of SAT in bounded model checking (BMC) and, more recently, in unbounded model checking (UMC). This paper addresses the utilization of interpolants in UMC and proposes two techniques for improving the original interpolant-based UMC algorithm. These techniques in...

Binary Decision Diagrams (BDDs) have dominated the area of symbolic model checking for the past decade. Recently, the use of satissability (SAT) solvers has emerged as an interesting complement to BDDs. SAT-based methods are capable of coping with some of the systems that BDDs are unable to handle. The most challenging problem that has to be solved in order to adapt standard symbolic model chec...

In recent years we have viewed tremendous improvements in the field of Propositional satisfiability (SAT). Many NPcomplete problems from a variety of domains, such as classic planning problems (Kautz 1999), have been compiled into SAT instances, and solved effectively by SAT solvers (Zhang et al 2001). On the other hand, the problem of counting the number of models of a prepositional formula (#...

Induction is a key element of state-of-the-art veri cation techniques. Automatically synthesizing and verifying inductive invariants is at the heart of Model Checking of safety properties. In this paper, we study the relationship between two popular approaches to synthesizing inductive invariants: SAT-based Model Checking (SAT-MC) and Machine Learning-based Invariant Synthesis (MLIS). Our goal ...

Executive Summary: This study evaluated the relationship between academic outcomes and SAT scores. A descriptive analysis indicated that students with higher SAT scores tend on average to have better academic outcomes (retention, graduation, and cumulative GPA), although this relationship was weaker at the higher end of the SAT score spectrum (i.e. students with very high SAT scores do not nece...

Modern symbolic model checking techniques use Binary Decision Diagrams (BDD) and propositional satisfiability (SAT) decision procedures for checking validity and satisfiability of propositional Boolean formulas, which are used to encode sub-problems of symbolic model checking. Usage of propositional formulas imposes a potential exponential memory blow-up on the model checking algorithms due to ...

A growing number of problem domains are successfully being tackled by SAT solvers. This thesis contributes to that trend by pushing the state-of-the-art of core SAT algorithms and their implementation, but also in several important application areas. It consists of five papers: the first details the implementation of the SAT solver MINISAT and the other four papers discuss specific issues relat...

The mechanism of ice nucleation to form Type 2 PSCs is important for controlling the ice particle size and hence the possible dehydration in the polar winter stratosphere. This paper probes heterogeneous ice nucleation on sulfuric acid tetrahydrate (SAT). Laboratory experiments were performed using a thin-film, high-vacuum apparatus in which the condensed phase is monitored via Fourier transfor...

We investigate a SAT-based bounded model checking (BMC) method for EMTLK (the existential fragment of the metric temporal logic with knowledge) that is interpreted over timed models generated by timed interpreted systems. In particular, we translate the existential model checking problem for EMTLK to the existential model checking problem for a linear temporal logic (called HLTLK), and we provi...