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...

詳細記述

書誌詳細
主要な著者: Kaiser, A, Kroening, D, Wahl, T
その他の著者: Koutny, M
フォーマット: Conference item
出版事項: Springer 2012

類似資料