Abstract Bounded Model Checking (BMC) has been recently introduced as an efficient
verification method for reactive systems. BMC based on SAT methods consists in searching …

The objective of this paper is to offer an improvement to the translation from ECTL to SAT
introduced in [14] and show that the improvement proposed substantially increases the …

Abstract The introduction of Past Operators enables to produce more natural formulation of a
wide class of properties of reactive systems, compared to traditional pure future temporal …

If we restrict our attention to finite state programs (variables and communication channels if
any range over finite domains), then the whole program can be represented as a (generally …

Although automated proof checking tools for general-purpose logics have been successfully
employed in the verification of digital systems, there are inherent limits to the efficient …

Abstract Bounded Model Checking (BMC) based on SAT methods consists in searching for
a counterexample of a particular length and to generate a propositional formula that is …

Bounded model checking (BMC) is an attractive alternative to symbolic model checking,
since it often allows a more efficient verification. The idea of BMC is to reduce the model …

Manna and Pnueli have extensively shown how a mixture of first-order logic (FOL) and
discrete Linear time Temporal Logic (LTL) is sufficient to precisely state verification problems …

This paper gives an on-the-fly algorithm for determining whether a finite-state system
satisfies a formula in the temporal logic CTL. The time complexity of our algorithm matches …

Abstract Model checking is a useful technique to verify properties of dynamic systems but it
has to cope with the state explosion problem. By simultaneous exploitation of symmetries of …