Abstract Model checking is an automatic technique for verifying finite-state reactive systems,
such as sequential circuit designs and communication protocols. Specifications are …

One of the most important industrial applications of SAT is currently Bounded Model
Checking (BMC). This technique is typically used for formal hardware verification in the …

We consider a fully SAT-based method of unbounded symbolic model checking based on
computing Craig interpolants. In benchmark studies using a set of large industrial circuit …

Context: Safety is of paramount importance for cyber–physical systems in domains such as
automotive, robotics, and avionics. Formal methods such as model checking are one way to …

Program termination is central to the process of ensuring that systems code can always
react. We describe a new program termination prover that performs a path-sensitive and …

Model checking is a prominent technique used in the hardware and software industries for
automatic verification. While it is very successful in finding subtle bugs in distributed …

Deep neural networks (DNNs) have gained significant popularity in recent years, becoming
the state of the art in a variety of domains. In particular, deep reinforcement learning (DRL) …

Distributed protocols have long been formulated in terms of their safety and liveness
properties. Much recent work has focused on automatically verifying the safety properties of …

We consider the problem of bounded model checking (BMC) for linear temporal logic (LTL).
We present several efficient encodings that have size linear in the bound. Furthermore, we …

In the event that a system does not satisfy a specification, a model checker will typically
automatically produce a counterexample trace that shows a particular instance of the …