Abstract. We present Boom, a comprehensive analysis tool for Boolean programs. We focus in this paper on model-checking non-recursive concurrent programs. Boom implements a recent ...
Abstract. The paper presents the preliminary version of Ontobella - a domain ontology of beliefs. The philosophical assumptions of this system are taken from the philosophy of Roma...
Pawel Garbacz, Marek Lechniak, Piotr Kulicki, Robe...
Abstract. In this paper we examine the difference between model checking high-level and low-level models. In particular, we compare the ProB model checker for the B-method and the ...
We study the model checking problem of timed automata based on SAT solving. Our work investigates alternative possibilities for coding the SAT reductions that are based on parallel...
Systems and protocols combining concurrency and infinite state space occur quite often in practice, but are very difficult to verify automatically. At the same time, if the system ...