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
|
類似資料
-
Lost in abstraction: monotonicity in multi-threaded programs
著者:: Kaiser, A, 等
出版事項: (2016) -
Lost in abstraction: monotonicity in multi-threaded programs
著者:: Kaiser, A, 等
出版事項: (2014) -
A widening approach to multithreaded program verification
著者:: Kaiser, A, 等
出版事項: (2014) -
Proof-graphs for Minimal Implicational Logic
著者:: Marcela Quispe-Cruz, 等
出版事項: (2014-03-01) -
Image Computation and Predicate Refinement for RTL Verilog using Word Level Proofs
著者:: Kroening, D, 等
出版事項: (2007)