Abstract—Many applications are concurrent and communicate over a network. The non-determinism in the thread and communication schedules makes it desirable to model check such sys...
Abstract. We propose a novel algorithm for automata-based LTL model checking that interleaves the construction of the generalized B¨uchi automaton for the negation of the formula ...
Abstract. Regular Model-Checking (RMC) is a technique for the formal verification of infinite state systems based on the theory of regular languages. In the paper “Beyond Regul...
We propose a word level, bounded model checking (BMC) algorithm based on translation into the effectively propositional fragment (EPR) of firstorder logic. This approach to BMC al...
Moshe Emmer, Zurab Khasidashvili, Konstantin Korov...
Abstract. We have argued previously that the e ectiveness of a veri cation system derives not only from the power of its individual features for expression and deduction, but from ...