Model checking software transactional memories (STMs) is difficult because of the unbounded number, length, and delay of concurrent transactions and the unbounded size of the memo...
While implicit invocation (publish-subscribe) systems have goodengineering properties, they are difficult toreason about and to test. Model checking such systems is an attractive...
A variety of assume-guarantee model checking approaches have been proposed in the literature. In this paper, we describe several possible implementations of those approaches for ch...
Corina S. Pasareanu, Matthew B. Dwyer, Michael Hut...
Abstract. ToolBus allows to connect tools via a software bus. Programming is done using the scripting language Tscript, which is based on the process algebra ACP. In previous work ...
Wan Fokkink, Paul Klint, Bert Lisser, Yaroslav S. ...
Abstract. The paper presents methods for model checking a class of possibly infinite state concurrent programs using various types of bi-simulation reductions. The proposed method...