Efficient coverability analysis by proof minimization

We consider multi-threaded programs with an unbounded number of threads executing a finite-state, non-recursive procedure. Safety properties of such programs can be checked via reduction to the coverability problem for well-structured transition systems (WSTS). In this paper, we present a novel, sou...

Disgrifiad llawn

Manylion Llyfryddiaeth
Prif Awduron: Kaiser, A, Kroening, D, Wahl, T
Awduron Eraill: Koutny, M
Fformat: Conference item
Cyhoeddwyd: Springer 2012

Eitemau Tebyg