d abstract) Christel Baiera, Joost-Pieter Katoenb;c and Holger Hermannsc aLehrstuhl fur Praktische Informatik II, University of Mannheim 68131 Mannheim, Germany bLehrstuhl fur Info...
We consider the problem of checking whether a finite (or ultimately periodic) run satisfies a temporal logic formula. This problem is at the heart of “runtime verification” ...
Abstract. This paper explores a way to apply model checking techniques to parallel programs that use the nonblocking primitives of the Message Passing Interface (MPI). The method h...
Abstract. The paper presents a partial order reduction method applicable to networks of timed automata. The advantage of the method is that it reduces both the number of explored c...
Recent development in computer hardware has brought more wide-spread emergence of shared-memory, multi-core systems. These architectures offer opportunities to speed up various ta...