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...
Prif Awduron: | Kaiser, A, Kroening, D, Wahl, T |
---|---|
Awduron Eraill: | Koutny, M |
Fformat: | Conference item |
Cyhoeddwyd: |
Springer
2012
|
Eitemau Tebyg
-
Lost in abstraction: monotonicity in multi-threaded programs
gan: Kaiser, A, et al.
Cyhoeddwyd: (2016) -
Lost in abstraction: monotonicity in multi-threaded programs
gan: Kaiser, A, et al.
Cyhoeddwyd: (2014) -
A widening approach to multithreaded program verification
gan: Kaiser, A, et al.
Cyhoeddwyd: (2014) -
Proof-graphs for Minimal Implicational Logic
gan: Marcela Quispe-Cruz, et al.
Cyhoeddwyd: (2014-03-01) -
Image Computation and Predicate Refinement for RTL Verilog using Word Level Proofs
gan: Kroening, D, et al.
Cyhoeddwyd: (2007)