Simple Bounded LTL Model Checking

Evaluation of SAT-based Bounded Model Checking of ACTL Properties

“…One is to improve the encoding based on [12], so we can reduce the length of the encoding. The other is to use non-CNF SATsolver like SatMate [10], thus to reduce the overhead due to the need for additional variables when converting the encoding to DIMACS format.…”

Model Checking and the State Explosion Problem

“…More efficient translations are given in [15,16,2]; these translations have the benefit of having size linear in k (the unrolling depth) for the U operator, compared to size cubic in k (or quadratic in k, if certain optimizations [6] are used) for the translations in Definitions 10 and 11. We use the same formula M k as the original encoding (defined in Equation 3 on page 22) to constrain the path to be a valid prefix.…”

Incremental and Complete Bounded Model Checking for Full PLTL

“…We start by presenting an incremental encoding for LTL based on our simple BMC encoding [20,18]. There are a few considerations that need to be taken into account for a good incremental encoding.…”

“…, l k+1 variables is true, or (b) a (k, i)-loop, in which case the variable l i is true and all other l j variables are false. Many k-dependent constraints of our original encoding [20] have been eliminated by introducing a new special system state s E with fresh (unconstrained) state variables acting as a proxy state for the endpoint of the path. In the k-dependent part the proxy state s E is constrained to be equivalent to s k .…”

“…One intuition for understanding the encoding is given by the fact that for (k, l)-loops the semantics of CTL and LTL coincide [21,22,20]. Thus for (k, l)-loops the encoding can be seen as a CTL model checker for the single (k, l)-loop selected by the loop constraints.…”